//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
int const N=1e6+10;
int n,m,k,a[N],b[N],f[N],rd[N];
vector<int>e[N];
inline void solve(){
	cin>>n>>m>>k;
	rep(i,1,n) cin>>a[i];
	rep(i,1,k) cin>>b[i];
	memset(f,0x3f,sizeof(f));
	rep(i,1,m){
		int u,v;cin>>u>>v;
		e[v].push_back(u),++rd[u];
	}
	queue<int>q;
	rep(i,1,n) if (!rd[i]) q.push(i);
	while (!q.empty()){
		int x=q.front();q.pop();
		for (auto v:e[x]){
			f[v]=min(f[v],f[x]);
			if (a[x]+1<f[v]) f[v]=min(f[v],a[x]);
			if (!--rd[v]) q.push(v);
		}
	}
	rep(i,1,n)
		if (f[i]>k) cout<<"-1 ";
		else cout<<f[i]-1<<' ';
	cout<<'\n';
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t=1;
	// cin>>t;
	while (t--) solve();
	return 0;
}