#include <bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int T,n,m,k,l,s[N],d[N],dis[N],mk[N],vis[N],p[N],f[N],ind[N];
vector<int>G[N],F[N],H[N];
queue<int>q;
void clear(){
    for(int i=1;i<=n;i++){
        F[i].clear(),G[i].clear(),H[i].clear();
        s[i]=d[i]=dis[i]=mk[i]=0;
        ind[i]=vis[i]=p[i]=f[i]=0;
    }
    n=m=k=l=0;
    return;
}
void add(int x,int y){
    G[x].push_back(y); 
} 
void link(int x,int y){
    F[x].push_back(y);
    ind[y]++;
}
void edge(int x,int y){
    H[x].push_back(y);
}
void dfs(int x){
//    printf("%d\n",x);
    if(vis[x])return;vis[x]=1;
    for(auto y:H[x])dfs(y);
}
void work(){
    scanf("%d %d %d %d",&n,&m,&k,&l);
    for(int i=1;i<=k;i++){
        scanf("%d",s+i);
        p[s[i]]=1;
    }
    for(int i=1;i<=l;i++)scanf("%d",d+i);
    for(int i=1,u,v;i<=m;i++){
        scanf("%d %d",&u,&v);
        add(u,v),add(v,u);
    }
    q.push(1),mk[1]=1,dis[1]=0;
    while(q.size()){
        int x=q.front();q.pop();
        for(auto y:G[x]){
            if(!mk[y]){
                dis[y]=dis[x]+1;
                mk[y]=1,q.push(y);
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(auto j:G[i]){
            if(dis[j]==dis[i]+1){
                link(i,j);
            }
        }
    }
    q.push(1);
    while(q.size()){
        int x=q.front();q.pop();
        for(auto y:F[x]){
            f[y]=max(f[y],f[x]+p[y]);
            ind[y]--;
            if(!ind[y])q.push(y);
        }
    }
    bool flag=0;
    for(int i=1;i<=n;i++){
        for(auto j:F[i]){
            if(f[j]==f[i]+p[j]){
                edge(j,i);
            }
        }
    }
    for(int i=1;i<=l;i++){
        if(f[d[i]]==k)flag=1;
    }
    if(!flag){
        for(int i=2;i<=n;i++)printf("0");
    }else{
        for(int i=1;i<=l;i++)if(f[d[i]]==k)dfs(d[i]);
        for(int i=2;i<=n;i++)printf("%d",vis[i]);
    }
    printf("\n");
    return;
}
int main(){
    freopen("Flowers.in","r",stdin);
    freopen("Flowers.out","w",stdout);  
    scanf("%d",&T);
    while(T--){
        work();
        clear();
    }
    return 0;
}