#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N, M; cin >> N >> M;

    vector<int> A(N);
    rep(i, N) cin >> A[i];

    vector<vector<int>> es(N);

    rep(i, M){
        int u, v; cin >> u >> v; u--, v--;
        es[u].eb(v), es[v].eb(u);
    }

    vector<int> on(N, 0);
    
    int K; cin >> K;
    rep(i, K){
        int x; cin >> x; x--,
        on[x] = 1;
    }

    vector<int> v(N);
    iota(all(v), 0);
    sort(all(v), [&](int i, int j){
        return A[i] < A[j];
    });

    vector<int> ans;

    each(e, v){
        if(on[e] == 0) continue;

        on[e] = 0;
        each(u, es[e]){
            if(A[u] > A[e]) on[u] ^= 1;
        }
        ans.eb(e);
    }

    cout << sz(ans) << '\n';
    each(e, ans) cout << e+1 << '\n';
}