#include <bits/stdc++.h>
#define lowbit(x) (x & (-x))
using namespace std;

const int N = 1000010, M = 220010;
int n, m, k, a[N], b[N], fir_app[N]; vector < int > edge[N];

vector < int > con[N]; int scc, belong[N];
namespace Tarjan
{
	int dfn[N], low[N], sign, sta[N], top; bool vis[N];
	inline void tarjan(int now)
	{
		dfn[now] = low[now] = ++sign, sta[++top] = now; vis[now] = true;
		for(int to : edge[now])
		{
			if(!dfn[to]) {tarjan(to); low[now] = min(low[now], low[to]);}
			else if(vis[to]) low[now] = min(low[now], dfn[to]);
		}
		if(dfn[now] == low[now])
		{
			++scc; sta[top + 1] = 0;
			while(sta[top + 1] != now)
			{
				vis[sta[top]] = false;
				con[scc].push_back(sta[top]);
				belong[sta[top]] = scc; --top;
			}
		}
	}
	
	inline void solve()
	{
		for(int i = 1; i <= n; ++i) if(!dfn[i]) tarjan(i);
	}
}

int ln[N], rn[N];
namespace Init
{
	int s_id[N], pt; bool tag[N];
	inline bool cmp(int x, int y) {return ln[x] > ln[y];}
	
	struct Chain
	{
		int pre, nxt, data, p;
	}; Chain ch[N]; int p_toch[N], idch, st_ch;
	inline void erase(int id)
	{
		if(id == st_ch) {st_ch = 0; return ;}
		int pr = ch[id].pre, nx = ch[id].nxt;
		ch[pr].nxt = nx, ch[nx].pre = pr;
	}
	inline void push_front(int id)
	{
		if(!st_ch) {st_ch = id; return ;}
		ch[id].nxt = st_ch;
		st_ch = id;
	}
	
	inline void solve()
	{
		for(int id = 1; id <= scc; ++id)
		{
			ln[id] = 1e9;
			for(int x : con[id]) ln[id] = min(ln[id], fir_app[a[x]]);
		}
		for(int i = 1; i <= scc; ++i) s_id[i] = i;
		sort(s_id + 1, s_id + scc + 1, cmp);
		pt = k;
		for(int i = 1; i <= scc; ++i)
		{
			int id = s_id[i];
			while(pt >= ln[id])
			{
				int c = b[pt];
				if(p_toch[c]) erase(p_toch[c]);
				ch[++idch].data = c, ch[idch].p = pt;
				push_front(idch);
				--pt;
			}
			for(int x : con[id]) tag[a[x]] = true;
			if(st_ch)
			{
				rn[id] = k;
				for(int j = st_ch; j; j = ch[j].nxt)
					if(!tag[ch[j].data])
						{rn[id] = ch[j].p - 1; break;}
			}
			for(int x : con[id]) tag[a[x]] = false;
		}
	}
}

int f[N];
namespace Dp
{
	bool vis[N];
	inline void solve()
	{
		memset(f, 0x3f, sizeof(f));
		for(int i = scc; i >= 1; --i)
		{
			vector < int > tr;
			for(int x : con[i])
			{
				for(int y : edge[x])
				{
					if(belong[x] == belong[y]) continue;
					if(vis[belong[y]]) continue;
					vis[belong[y]] = true;
					tr.push_back(belong[y]);
				}
			}
			for(int j : tr) vis[j] = false;
//			cerr << "DP " << i << " +++++++++++++++++++++\n";
			for(int j : tr)
			{
//				cerr << "tr " << j << " " << ln[j] << '\n';
				f[i] = min(f[i], f[j]);
				if(f[j] != ln[j] + 1) f[i] = min(f[i], ln[j]);
			}
		}
	}
}

int main()
{
//	freopen("text.in", "r", stdin);
//	freopen("prog.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> m >> k;
	for(int i = 1; i <= n; ++i) cin >> a[i];
	for(int i = 1; i <= k; ++i) cin >> b[i];
	memset(fir_app, 0x3f, sizeof(fir_app));
	for(int i = k; i >= 1; --i) fir_app[b[i]] = i;
	for(int i = 1, x, y; i <= m; ++i)
	{
		cin >> x >> y;
		edge[x].push_back(y);
	}
	Tarjan::solve(); Init::solve();
	Dp::solve();
	for(int i = 1; i <= n; ++i)
	{
		if(f[belong[i]] <= n) cout << f[belong[i]] - 1 << " ";
		else cout << -1 << " ";
	}
	cout << '\n';
	return 0;
}
/*

*/