#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<vector>
#define N 200005
#define int long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define mem(x) memset(x,0,sizeof(x))
#define sym() system("pause")
using namespace std;
int T,n,m,k,l,h[N],cnt,d[N],sa[N],sb[N],ans,op,x,y,z;
bool isg[N],isd[N];
bool visa[N],visb[N];
struct edge{int v,n;}e[N<<1];
void ad(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void bfs1(){
    queue<int>q;
    q.push(1);d[1]=1;
    while(q.size()){
        int u=q.front();q.pop();
        for(int i=h[u];i;i=e[i].n){
            int v=e[i].v;
            if(d[v])continue;
            d[v]=d[u]+1;
            q.push(v);
        }
    }
}
void bfs2(){
    queue<int>q;
    q.push(1);visa[1]=1;
    while(q.size()){
        int u=q.front();q.pop();
        for(int i=h[u];i;i=e[i].n){
            int v=e[i].v;
            if(d[v]!=d[u]+1)continue;
            sa[v]=max(sa[v],sa[u]+isg[v]);
            if(!visa[v])
                q.push(v),
                visa[v]=1;
        }
    }
}
void bfs3(){
    vector<int>rd[N];
    fo(i,1,n)rd[d[i]].push_back(i);
    rf(j,n,1)
        for(auto u:rd[j]){
            if(isd[u])visb[u]=1,sb[u]=max(sb[u],isg[u]);
            if(!visb[u])continue;
            for(int i=h[u];i;i=e[i].n){
                int v=e[i].v;
                if(d[u]!=d[v]+1)continue;
                visb[v]=1;
                sb[v]=max(sb[v],sb[u]+isg[v]);
            }
        }
}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("Flowers.in","r",stdin);freopen("Flowers.out","w",stdout);
    T=read();
    while(T--){
        n=read();m=read();k=read();l=read();
        cnt=0;fo(i,1,n)d[i]=sa[i]=sb[i]=h[i]=visa[i]=visb[i]=isg[i]=isd[i]=0;
        fo(i,1,k)x=read(),isg[x]=1;
        while(l--)x=read(),isd[x]=1;
        while(m--)x=read(),y=read(),ad(x,y),ad(y,x);
        bfs1();
        bfs2();
        bfs3();
        fo(i,2,n)
            if(visa[i]&&visb[i]&&sa[i]+sb[i]-isg[i]==k)
                printf("1");
            else
                printf("0");
        printf("\n");
    }
    
    return 0;
}