#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,K;
ll L,R,D,a[1004];
bool g[1004][54];
vector<ll>f[1004][54],nf[54];
vector<int>tr[1004];
void merge(vector<ll>&A,vector<ll>B){
	vector<ll>ans;int ia=0,ib=0;
	while(ia<A.size()&&ib<B.size()){
		if(A[ia]<B[ib]) ans.push_back(A[ia++]);
		else ans.push_back(B[ib++]);
	}
	while(ia<A.size())ans.push_back(A[ia++]);
	while(ib<B.size())ans.push_back(B[ib++]);
	ans.erase(unique(ans.begin(),ans.end()),ans.end());
	A.clear();
	for(int i=0;i<ans.size();i++)
		if(!i||i==ans.size()-1||ans[i+1]-A.back()>D)A.push_back(ans[i]);
}
void dfs(int x,int fa){
	for(int i=0;i<=K;i++)f[x][i].clear(),g[x][i]=0;
	f[x][0].push_back(a[x]);
	for(auto y:tr[x])if(y!=fa){
		dfs(y,x);
		for(int i=0;i<=K;i++)nf[i].clear();
		for(int i=0;i<=K;i++)if(!f[x][i].empty())
			for(int j=0;j<=K-i;j++)if(!f[y][j].empty()){
				if(g[y][j])merge(nf[i+j+1],f[x][i]);
				for(auto A:f[x][i]){
					vector<ll>vec;
					for(auto B:f[y][j])vec.push_back(A+B);
					merge(nf[i+j],vec);
				}
			}
		for(int i=0;i<=K;i++)f[x][i]=nf[i];
	}
	for(int i=0;i<=K;i++)
		for(auto w:f[x][i])if(L<=w&&w<=R)g[x][i]=1;
}
void sol(){
	scanf("%d%d%lld%lld",&n,&K,&L,&R),D=R-L;
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]),tr[i].clear();
	for(int i=1;i<n;i++){
		int u,v;scanf("%d%d",&u,&v);
		tr[u].push_back(v),tr[v].push_back(u);
	}dfs(1,0);
	for(int i=0;i<=K;i++)putchar('0'+g[1][i]);puts("");
}
int main(){
	int tc;scanf("%d",&tc);
	while(tc--)sol();
}