#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>

using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;

    vector<int> xs(n);
    for (auto& x : xs) cin >> x;

    vector<vector<int>> graph(n);
    while (m--) {
        int u, v;
        cin >> u >> v;
        --u, --v;

        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    vector<bool> stat(n, false);
    {
        int k;
        cin >> k;
        while (k--) {
            int v;
            cin >> v;
            stat[--v] = true;
        }
    }

    vector<int> vs(n);
    iota(vs.begin(), vs.end(), 0);
    sort(vs.begin(), vs.end(),
         [&](int u, int v) { return xs[u] < xs[v]; });

    vector<int> ans;
    for (auto v : vs) {
        if (!stat[v]) continue;
        ans.push_back(v + 1);

        stat[v] = !stat[v];
        for (auto u : graph[v]) {
            if (xs[u] > xs[v]) stat[u] = !stat[u];
        }
    }

    cout << ans.size() << "\n";
    for (auto v : ans) cout << v << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}