// created:  Dec/24/2022 11:51:02
#include<cstdio>
#include<cstring>
#include<vector>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
using namespace std;
template<typename T>void readmain(T &x)
{
	bool neg=false;
	unsigned int c=getchar();
	for(;(c^48)>9;c=getchar())if(c=='-')neg=true;
	for(x=0;(c^48)<10;c=getchar())x=(x<<3)+(x<<1)+(c^48);
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
constexpr int N=1005,K=52;
long long dif;
void add(long long a[2],const long long &b)
{
	if(~a[1])a[0]=min(a[0],b);
	else a[0]=b;
	a[1]=max(a[1],b);
}
void convolution(long long a[K][2],int n,long long b[K][2],int m,long long c[K][2])
{
	int ij=0;
	long long t,l;
	F(i,0,n+1)if(~a[i][0])F(j,(ij=i,l=(long long)ij*dif,0),m+1)if(~b[j][0])
	{
		l+=dif;
		t=a[i][0]+b[j][0];add(c[ij+(t>=l)],t);
		t=a[i][0]+b[j][1];add(c[ij+(t>=l)],t);
		t=a[i][1]+b[j][0];add(c[ij+(t>=l)],t);
		t=a[i][1]+b[j][1];add(c[ij+(t>=l)],t);
		++ij;
	}
}
int tt,n,k,siz[N];
bool ans[K];
long long a[N],l,r,f[N][K][K][2],t[K][K][2];
vector<int> adj[N];
void dfs(int u,int fa)
{
	memset(f[u],0xff,sizeof(long long)*2*K*(k+1));
	f[u][0][0][0]=f[u][0][0][1]=0;
	siz[u]=0;
	for(int v:adj[u])if(v!=fa)
	{
		dfs(v,u);
		memset(t,0xff,sizeof(long long)*2*K*(k+1));
		F(i,0,min(siz[u],k)+1)F(j,0,min(siz[v],k-i)+1)convolution(f[u][i],i,f[v][j],j,t[i+j]);
		memcpy(f[u],t,sizeof(long long)*2*K*(k+1));
		a[u]+=a[v];
		siz[u]+=siz[v];
	}
	++siz[u];
	if(u)
	{
		for(int i=min(siz[u],k);~--i;)
		{
			long long aa=a[u]-(i+1)*l;
			F(j,0,i+1)if(~f[u][i][j][0])
			{
				long long x=a[u]-f[u][i][j][1]-i*l,y=a[u]-f[u][i][j][0]-i*l;
				if(y>=l&&x<=r)
				{
					add(f[u][i+1][aa/dif],aa);
					break;
				}
			}
		}
	}
	else
	{
		for(int i=min(siz[u],k)+1;~--i;)F(j,0,i+1)if(~f[u][i][j][0])
		{
			long long x=a[u]-f[u][i][j][1]-i*l,y=a[u]-f[u][i][j][0]-i*l;
			if(y>=l&&x<=r)ans[i]=true;
		}
	}
}
int main()
{
	read(tt);
	while(tt--)
	{
		read(n,k,l,r);dif=r-l;
		F(i,0,n)read(a[i]);
		F(i,0,n)adj[i].clear();
		F(i,0,n-1)
		{
			int u,v;read(u,v);--u,--v;
			adj[u].emplace_back(v);
			adj[v].emplace_back(u);
		}
		memset(ans,0,sizeof ans);
		dfs(0,0);
		F(i,0,k+1)putchar(48+ans[i]);
		puts("");
	}
	return 0;
}