#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,n,k;
ll L,R;
ll AA[1005];
vector <int> G[1005];

int siz[1005];
vector <ll> dp[1005][55],tmp[55];
void psh(vector <ll> &cur,ll val){
	while(SZ(cur) >= 2 && val - cur[SZ(cur) - 2] <= R - L) cur.pop_back();
	cur.eb(val);
}

void comb(vector <ll> &res,vector <ll> &A,vector <ll> &B){
	vector <ll> temp;
	for(ll a:A){
		int i = 0;
		for(ll b:B){
			while(i < SZ(res) && res[i] < a + b) psh(temp,res[i++]);
			psh(temp,a + b);
		}
		while(i < SZ(res)) psh(temp,res[i++]);
		swap(res,temp);
		temp.clear();
	}
}

void prt(vector <ll> &A){
	for(ll a:A) printf("%lld ",a);
	printf("\n");
}

void dfs(int u,int f){
	rep(i,0,k) dp[u][i].clear();
	dp[u][0].eb(AA[u]);
	siz[u] = 0;
	for(int v:G[u]){
		if(v == f) continue;
		dfs(v,u);
		rep(i,0,min(siz[u] + siz[v],k)) tmp[i].clear();
		rep(i,0,min(siz[u],k)){
			rep(j,0,min(siz[v],k - i)) comb(tmp[i + j],dp[u][i],dp[v][j]);
		}
		siz[u] += siz[v];
		rep(i,0,min(siz[u],k)) dp[u][i] = tmp[i];
	}

	rep(i,0,k - 1){
		int valid = 0;
		for(ll &val:dp[u][i]) if(L <= val && val <= R) valid = 1;
		if(valid){
			dp[u][i + 1].eb(0);
			per(_k,SZ(dp[u][i + 1]) - 1,1) swap(dp[u][i + 1][_k],dp[u][i + 1][_k - 1]);
		}
	}
	siz[u]++;

/*	printf("node %d\n",u);
	rep(i,0,k){
		printf("i=%d ",i);
		prt(dp[u][i]);
	}*/
}

void solve(){
	scanf("%d%d%lld%lld",&n,&k,&L,&R);
	rep(u,1,n){
		scanf("%lld",&AA[u]);
		G[u].clear();
	}
	rep(i,1,n - 1){
		int u,v;
		scanf("%d%d",&u,&v);
		G[u].eb(v);G[v].eb(u);
	}
	dfs(1,0);
	rep(i,0,k){
		int valid = 0;
		for(ll &val:dp[1][i]) if(L <= val && val <= R) valid = 1;
		printf("%d",valid);
	}
	printf("\n");
}

int main(){	
//	freopen("test.in","r",stdin);
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}