#include <bits/stdc++.h>
using namespace std;

#define fo(i,a,b) for(int i=a;i<=b;++i)
#define ll long long
#define tt __int128_t

const int N = 1005;

int n, k, sz[N];
ll L, R, A[N];
vector<ll> f[N][55], g[55], tmp;
vector<int> e[N];

void mg(int x, int y) {
	fo(i, 1, k) g[i].clear();
	fo(a, 1, min(sz[x], k))
		fo(b, 1, min(sz[y], k - a + 1))
			for(ll u : f[x][a])
				for(ll v : f[y][b]) {
					if(a + b <= k && v >= L && v <= R) g[a + b].push_back(u);
					if(u + v <= R) g[a + b - 1].push_back(u + v);
				}
	fo(i, 1, k) {
		sort(g[i].begin(), g[i].end());
		tmp.clear();
		for(ll u : g[i]) {
			while(tmp.size() >= 2) {
				int id = tmp.size();
				if(u - tmp[id - 2] <= R - L + 1) tmp.pop_back();
				else break;
			}
			if(tmp.empty() || tmp.back() != u) tmp.push_back(u);
		}
		swap(f[x][i], tmp);
	}
	sz[x] += sz[y];
	return;
}

void dfs(int x, int from) {
	fo(i, 1, k) f[x][i].clear();
	sz[x] = 1, f[x][1].push_back(A[x]);
	for(int y : e[x])
	if(y != from) {
		dfs(y, x);
		mg(x, y);
	}
//	fo(i, 1, k) {
//		for(ll u : f[x][i]) printf("%lld ", u);
//		puts("");
//	}
//	puts("------");
	return;
}

void work() {
	scanf("%d %d %lld %lld", &n, &k, &L, &R); ++k;
	tt sum = 0;
	fo(i, 1, n) {
		scanf("%lld", &A[i]);
		sum += A[i];
	}
	fo(i, 1, n) {
		e[i].clear();
	}
	fo(i, 2, n) {
		int u, v; scanf("%d %d", &u, &v);
		e[u].push_back(v);
		e[v].push_back(u);
	}
	dfs(1, 0);
	fo(i, 1, k) {
		printf("%d", f[1][i].size() > 0);
	}
	puts("");
	return;
}

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