#include <bits/stdc++.h>
#define int long long 
#define pb push_back
using namespace std;
const int INF=1e6+5;
int n,m,k,a[INF],f[INF],in[INF],b[INF];
queue <int> q;
vector <int> e[INF],e2[INF];
void solve() {
    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 x=0,y=0;cin>>x>>y;
        e[x].pb(y);e2[y].pb(x);in[x]++;
    }
    memset(f,63,sizeof f);
    for (int i=1;i<=n;i++)
        if (!in[i]) q.push(i);
    while (q.size()) {
        int x=q.front();q.pop();
        for (int v:e2[x]) {
            f[v]=min(f[v],f[x]);
            if (a[x]<=k && f[v]-1>a[x]) f[v]=a[x];
            if (!--in[v]) q.push(v);
        }
    }
    for (int i=1;i<=n;i++)
        if (f[i]>k*2) cout<<"-1 ";
        else cout<<f[i]-1<<" ";
}
signed main()
{
    ios::sync_with_stdio(false);
    int t=1;
    while (t--) solve();
    return 0;
}