#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

void solve() {
    ll n, m;
    cin >> n >> m;
    vector<ll> a(n);
    rep(i, 0, n) cin >> a[i];
    vector<vector<ll>> G(n);
    rep(i, 0, m) {
        ll u, v;
        cin >> u >> v;
        u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    ll k;
    cin >> k;
    vector<ll> cnt(n, 0);
    rep(i, 0, k) {
        ll u;
        cin >> u;
        u--;
        cnt[u] = 1;
    }
    vector<ll> idx(n);
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](auto l, auto r) {
        return a[l] < a[r];
    } );
    vector<ll> ans;
    for(auto i : idx) {
        if(cnt[i] % 2 == 0) continue;
        ans.push_back(i+1);
        for(auto j : G[i]) {
            if(a[i] < a[j]) cnt[j]++;
        }
    }
    cout << ans.size() << "\n";
    for(auto e : ans) cout << e << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}