#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <random>
#include <ctime>
#include <chrono>
#include <numeric>
#include <iomanip>
#include <cassert>

typedef long long ll;
typedef double lf;
typedef unsigned long long ull;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1e6 + 10;

int n, m, k;
int a[MAXN], b[MAXN];
vector <int> e[MAXN], vec[MAXN], g[MAXN];

int dfn[MAXN], low[MAXN], clk, bel[MAXN], scc, st[MAXN], top; bool inq[MAXN];
void Tarjan(int u)
{
    dfn[u] = low[u] = ++clk, inq[u] = 1, st[++top] = u;
    for (auto v : e[u])
        if (!dfn[v]) Tarjan(v), low[u] = min(low[u], low[v]);
        else if (inq[v]) low[u] = min(low[u], dfn[v]);
    if (low[u] == dfn[u])
    {
        scc++;
        while (st[top] != u) inq[st[top]] = 0, bel[st[top]] = scc, top--;
        bel[u] = scc, inq[u] = 0, top--;
    }
}

int apr[MAXN], lst[MAXN], mnpos[MAXN];
int pre[MAXN], nxt[MAXN], dl[MAXN], da[MAXN], db[MAXN], dt;
int h1[MAXN], h2[MAXN];
int mn[MAXN], f[MAXN];

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m), Read(k);
    for (int i = 1; i <= n; i++) Read(a[i]), mnpos[i] = 2e9;
    for (int i = 1; i <= k; i++) Read(b[i]);
    for (int i = 1, u, v; i <= m; i++) Read(u), Read(v), e[u].push_back(v);
    for (int i = 1; i <= n; i++)
        if (!dfn[i]) Tarjan(i);
    for (int i = 1; i <= k; i++) lst[i] = apr[b[i]], apr[b[i]] = i;
    for (int i = 1, t = 0; i <= k; i++)
        if (!lst[i])
        {
            lst[i] = mnpos[b[i]] = i;
            pre[i] = t, t = i;
        }
    for (int i = 1; i <= k; i++)
        if (lst[i] == i) nxt[pre[i]] = i;
    for (int i = 1; i <= scc; i++) mn[i] = 2e9;
    for (int i = 1; i <= n; i++) mn[bel[i]] = min(mn[bel[i]], mnpos[a[i]]), vec[bel[i]].push_back(a[i]);
    for (int i = 1; i <= scc; i++)
    {
        for (auto x : vec[i]) inq[x] = 1;
        for (auto x : vec[i])
            if (inq[x])
            {
                inq[x] = 0;
                int u = mnpos[x];
                if (u == mn[i] || u > k) continue;
                dl[++dt] = u, da[dt] = pre[u], db[dt] = nxt[u];
                nxt[pre[u]] = nxt[u], pre[nxt[u]] = pre[u];
            }
        h2[i] = (nxt[mn[i]] ? nxt[mn[i]] : 2e9);
        while (dt) nxt[da[dt]] = dl[dt], pre[db[dt]] = dl[dt], dt--;
    }
    for (int i = k; i >= 1; i--)
    {
        while (top && lst[st[top]] >= lst[i]) top--;
        st[++top] = i;
        while (top && lst[st[top]] >= i) top--;
        h1[i] = (top ? st[top] : 2e9);
    }
    for (int u = 1; u <= n; u++)
        for (auto v : e[u])
            if (bel[u] ^ bel[v]) g[bel[u]].push_back(bel[v]);
    for (int u = 1; u <= scc; u++)
    {
        f[u] = 2e9;
        for (auto v : g[u])
        {
            f[u] = min(f[u], f[v]);
            if (mn[v] + 1 < f[v]) f[u] = min(f[u], mn[v]);
        }
        if (vec[u].size() > 1 && mn[u] + 1 < f[u])
        {
            int p = min(f[u] - 2, min(h2[u], h1[mn[u]]));
            f[u] = min(f[u], mn[u] + (~(p - mn[u]) & 1));
        }
    }
    for (int i = 1; i <= n; i++) cout << (f[bel[i]] > k ? -1 : f[bel[i]] - 1) << ' '; cout << '\n';
    return 0;
}