#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 1000100
IL int read()
{
    reg int x=0,f=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return f?-x:x;
}

int n,m,k,a[N],b[N],mn[N];
std::vector<int>G[N],vec[N];

IL void add(reg int u,reg int v){G[u].push_back(v);}

int f[N],g[N],dfn[N],low[N],dfc,s[N],top;
bool vis[N];

IL void cmin(reg int &x,reg int y){x>y?x=y:0;}
IL int min(reg int x,reg int y){return x<y?x:y;}

int cnt,sz[N],blo[N],w[N];

void tarjan(reg int u)
{
    dfn[u]=low[u]=++dfc,vis[s[++top]=u]=1;
    for(auto v:G[u])
        if(!dfn[v])tarjan(v),cmin(low[u],low[v]);
        else if(vis[v])cmin(low[u],dfn[v]);
    if(dfn[u]==low[u])
    {
        ++cnt,w[cnt]=g[cnt]=k+1;
        reg int v;
        do
        {
            v=s[top--],blo[v]=cnt,vis[v]=0;
            ++sz[cnt],cmin(w[cnt],mn[a[v]]);
        }while(u!=v);
    }
}

int deg[N];
std::vector<int>E[N],IE[N],shelf[N];

IL void add2(reg int u,reg int v){E[u].push_back(v),IE[v].push_back(u),++deg[v];}

bool dp[N],coef[N],done[N];

IL bool query(reg int u)
{
    bool res=coef[u];
    if(!done[u])res^=dp[u];
    return res;
}

main()
{
    n=read(),m=read(),k=read();
    for(reg int i=1;i<=n;++i)a[i]=read();
    for(reg int i=1;i<=k;++i)b[i]=read();
    for(reg int i=1,x,y;i<=m;++i)
        x=read(),y=read(),add(x,y);
    for(reg int i=1;i<=n;++i)vec[a[i]].push_back(i);
    for(reg int i=1;i<=n;++i)mn[i]=k+1;
    for(reg int i=1;i<=k;++i)cmin(mn[b[i]],i);
    for(reg int i=1;i<=n;++i)if(!dfn[i])tarjan(i);
    for(reg int u=1;u<=n;++u)for(auto v:G[u])
        if(blo[u]!=blo[v])add2(blo[v],blo[u]);
    std::queue<int>q;
    for(reg int i=1;i<=cnt;++i)if(!deg[i])q.push(i);
    while(!q.empty())
    {
        reg int u=q.front(); q.pop();
        f[u]=min(g[u],w[u]);
        for(auto v:E[u])
        {
            cmin(g[v],f[u]);
            if(!--deg[v])q.push(v);
        }
    }
    for(reg int i=1;i<=n;++i)shelf[blo[i]].push_back(a[i]);
    for(reg int i=1,j;i<=cnt;++i)
    {
        static bool exist[N];
        for(auto x:shelf[i])exist[x]=1;
        bool ok=1;
        for(j=f[i];j<g[i];++j)
        {
            if(!exist[j])
            {
                ok=0;
                break;
            }
            coef[i]^=1;
        }
        if(sz[i]==1)ok&=f[i]==g[i],coef[i]=0;
        if(!ok)done[i]=1;
        for(auto x:shelf[i])exist[x]=0;
    }
    // for(reg int i=1;i<=n;++i)
    //     printf("[%d, %d]\n",f[blo[i]],g[blo[i]]);
    for(reg int i=1,u;i<=cnt;++i)
    {
        u=i;
        if(g[u]>=k)
        {
            dp[u]=g[u]==k;
            continue;
        }
        for(auto v:IE[u])
            if(g[v]==g[u])dp[u]|=dp[v];
            else if(f[v]==g[u])
            {
                if(sz[v]>1)dp[u]|=query(v);
                else dp[u]|=g[v]>f[v]+1||!dp[v];
            }
    }
    for(reg int i=1,x,w;i<=n;++i)
    {
        x=blo[i];
        if(sz[x]>1)
        {
            if(query(x))w=f[x];
            else w=f[x]+1;    
        }else
        {
            if(dp[x])w=g[x];
            else w=g[x]+1;
        }        
        printf("%d%c",w>k?-1:w-1," \n"[i==n]);
    }
}