#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int N = 1e6 + 5;
int n, m, k;
int a[N], b[N], d[N], topo[N], id[N];
vector<int> pos[N], v2[N];
unordered_map<int, int> mp[N];
vector<int> e[N], e1[N], e2[N];
bool vis[N]; int state[N];
vector<int> cur[N], chk[N], toans[N];
int lt[N], rt[N];
int dfsnum, dfn[N], low[N], colnum, col[N], top, sta[N];
int T, lsttm[N], f[N], ans[N];//1 for win, 0 for lose
bool vis2[N];
void tarjan(int u){
	dfn[u] = low[u] = ++dfsnum;
	sta[++top] = u;
	for (int v : e[u])
		if (!dfn[v]){
			tarjan(v);
			low[u] = min(low[v], low[u]);
		}else if (!col[v]) low[u] = min(dfn[v], low[u]);
	if (dfn[u] == low[u]){
		colnum++;
		do{
			col[sta[top]] = colnum;
			mp[colnum][a[sta[top]]]++;
			pos[a[sta[top]]].push_back(colnum);
			v2[colnum].push_back(sta[top]);
		}while (sta[top--] != u);
	}
}
bool cmp(int u, int v){
	return id[u] > id[v];
}
void dfs(int u){
	if (state[u] == 2) return;
	cur[T].push_back(u);
	if (state[u] == 1){
		state[u] = 2;
		lsttm[u] = T;
		return;
	}
	state[u] = 2;
	toans[T].push_back(u);
	for (int v : e2[u])
		dfs(v);
}
void update(int u, int l, int r){
	bool flg = 0;
	if (r == 0) r = k + 1, flg = 1;
	int res = r;
	for (int i = l; i < r; i++){
		if (mp[u].find(b[i]) == mp[u].end()){
			res = i;
			break;
		}
		if (i != l && b[i] == b[i - 1] && mp[u][b[i]] == 1){
			res = i;
			break;
		}
	}
	int win = res == r ? (f[u] ^ ((r - l) & 1)) : (res - l) % 2;
	for (int x : v2[u])
		ans[x] = l + (win == 0);
	if (mp[u][b[l]] == 1){
		int p = -1;
		for (int x : v2[u])
			if (a[x] == b[l])
				p = x;
		int i = l;
		while (i < r && (b[i] == b[l] || mp[u].find(b[i]) == mp[u].end())) i++;
		if (i == r) ans[p] = flg ? 0 : r + (f[u] == 0);
		else{
			int win2 = res == r ? (f[u] ^ ((r - i) & 1)) : (res - i) % 2;
			ans[p] = i + (win2 == 0);
		}
	}
	f[u] = win;
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//	freopen("in.txt", "r", stdin);
//	freopen("out.txt", "w", stdout);
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= k; i++) cin >> b[i];
	for (int i = 1; i <= m; i++){
		int u, v;
		cin >> u >> v;
		e[u].push_back(v);
	}
	for (int i = 1; i <= n; i++)
		if (!dfn[i])
			tarjan(i);
	for (int i = 1; i <= n; i++)
		for (int v : e[i])
			if (col[i] != col[v]){
				e1[col[i]].push_back(col[v]);
				e2[col[v]].push_back(col[i]);
			}
	queue<int> q;
	for (int i = 1; i <= colnum; i++){
		sort(e1[i].begin(), e1[i].end());
		e1[i].erase(unique(e1[i].begin(), e1[i].end()), e1[i].end());
		sort(e2[i].begin(), e2[i].end());
		e2[i].erase(unique(e2[i].begin(), e2[i].end()), e2[i].end());
		d[i] = e2[i].size();
		if (!d[i]) q.push(i);
	}
	int tot = 0;
	while (!q.empty()){
		int u = q.front(); q.pop();
		topo[++tot] = u;
		id[u] = tot;
		for (int v : e1[u])
			if (--d[v] == 0)
				q.push(v);
	}
	for (int i = 1; i <= k; i++)
		if (!vis[b[i]]){
			T = i;
			vis[b[i]] = 1;
			sort(pos[b[i]].begin(), pos[b[i]].end(), cmp);
			pos[b[i]].erase(unique(pos[b[i]].begin(), pos[b[i]].end()), pos[b[i]].end());
			for (int x : pos[b[i]])
				if (state[x] == 0){
					state[x] = 1;
					chk[i].push_back(x);
					cur[i].push_back(x);
					for (int v : e2[x]) dfs(v);
				}
		}
	for (int i = k; i >= 1; i--){
		sort(cur[i].begin(), cur[i].end(), cmp);
		for (int x : chk[i]) update(x, i, lsttm[x]);
		for (int x : cur[i]) vis2[x] = 1;
		for (int x : cur[i])
			if (f[x])
				for (int y : e2[x])
					if (vis2[y])
						f[y] = 1;
		for (int x : toans[i])
			for (int u : v2[x])
				ans[u] = i + (f[x] == 0);
		for (int x : cur[i]) vis2[x] = 0;
	}
	for (int i = 1; i <= n; i++) cout << (ans[i] == k + 1 ? -1 : ans[i] - 1) << ' ';
	return 0;
}