#include <bits/stdc++.h>
using namespace std;

vector<int> res;
int main() {
	int n, m;
	cin >> n >> m;
	vector<int> G[n], a(n);
	for(auto &v : a) cin >> v;
	for(int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v, --u, --v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	vector<int> perm(n), review(n);
	iota(perm.begin(), perm.end(), 0);
	sort(perm.begin(), perm.end(), [&a](const int i, const int j) { return a[i] < a[j]; });
	for(int i = 0; i < n; i++) review[perm[i]] = i;

	vector<int> state(n);
	int k;
	cin >> k;
	for(int i = 0; i < k; i++) {
		int b;
		cin >> b, --b;
		state[review[b]] = 1;
	}

	for(int i = 0; i < n; i++) {
		int &now = perm[i];
		if(!state[i]) continue;
		res.push_back(now + 1);
		state[i] = 0;
		for(int to : G[perm[i]]) {
			if(a[now] >= a[to]) continue;
			state[review[to]] = !state[review[to]];
		}
	}

	cout << res.size() << '\n';
	for(auto &v : res) cout << v << '\n';
}