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

typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;

int a[maxn], b[maxn], q[maxn], in[maxn], ans[maxn], n;
vector<int> g[maxn];

void Topo()
{
    int hd = 1, tl = 0;
    for (int i = 1; i <= n; i++) if (!in[i]) q[++tl] = i;
    while (hd <= tl)
    {
        int u = q[hd++];
        for (int v : g[u])
            if (--in[v] == 0) q[++tl] = v;
    }
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);

    int m, k; 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;
        g[u].emplace_back(v), in[v]++;
    }
    Topo();
    for (int i = n; i; i--)
    {
        int u = q[i]; ans[u] = inf;
        for (int v : g[u])
        {
            ans[u] = min(ans[u], ans[v]);
            if (a[v] <= k && ans[v] > a[v] + 1) ans[u] = min(ans[u], a[v] - 1);
        }
    }
    for (int i = 1; i <= n; i++) cout << (ans[i] == inf ? -1 : ans[i]) << " ";
    return 0;
}