#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif
 
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) {bool f = true; os << "["; for (const auto &x : c) {if (!f) os << ", "; f = false; os << x;} return os << "]";}
template<typename T> void debug(string s, T x) {cerr << "\033[1;35m" << s << "\033[0;32m = \033[33m" << x << "\033[0m\n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << "\033[1;35m" << s.substr(0, i) << "\033[0;32m = \033[33m" << x << "\033[31m | "; debug(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}

typedef int int2;
#define int long long
#define pi pair<int, int>
#define vi vector<int>
#define vii vector<vector<int>>
#define vpi vector<pi>
#define lep(i,l,r) for(int i=l;i<=r;++i)
#define rep(i,r,l) for(int i=r;i>=l;--i)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define f first
#define s second
const int inf = 1e18;

int t;

const int maxn = 1005;
const int maxk = 51;
set<pi> dp[maxn]; // (num components, total overflow)

int2 main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> t;
    while (t--) {
        int n, k, l, r;
        cin >> n >> k >> l >> r;

        vector<int> a(n+1);
        lep(i,1,n) {
            cin >> a[i];
        }
        vector<vector<int>> adj(n+1);
        lep(i,1,n-1) {
            int u,v;
            cin >> u >> v;
            adj[u].pb(v);
            adj[v].pb(u);
        }

        vector<int> sub(n+1);

        auto dfs1 = [&](auto &self, int u, int p) -> void {
            int val = a[u];
            for (int v: adj[u]) {
                if (v != p) {
                    self(self,v,u);
                    val += sub[v];
                }
            }
            sub[u] = val;
            assert(sub[u] >= 0);
        };

        dfs1(dfs1,1,0);

        auto dfs2 = [&](auto &self, int u, int p) -> void {
            set<pi> curdp = {mp(0LL,0LL)};
            for (int v: adj[u]) {
                if (v != p) {
                    self(self,v,u);
                    set<pi> nextdp;
                    for (auto [nc, oc]: curdp) {
                        for (auto [nv, ov]: dp[v]) {
                            if (nc + nv <= k) {
                                nextdp.insert({nc+nv,oc+ov});
                            }
                        } 
                    }
                    swap(curdp, nextdp);
                }
            }
            // DEBUG(u,curdp);
            for (auto [nc, oc]: curdp) {
                // remaining stuff is <= R -> might be relevant for future components
                int gap = sub[u] - l * nc - oc;
                if (gap <= r) {
                    dp[u].insert({nc,oc});
                }
                // check if you're allowed to make a new component
                if (l <= gap and gap <= r) {
                    if (nc == k+1) continue;
                    dp[u].insert({nc+1, sub[u] - (nc+1)*l});
                }
            }
        };

        dfs2(dfs2,1,0);

        // DEBUG(dp[1]);
        // DEBUG(dp[2]);
        // DEBUG(dp[3]);
        // DEBUG(dp[4]);

        lep(i,1,k+1) {
            int target_overflow = sub[1] - i * l;
            // DEBUG(i,target_overflow);
            if (dp[1].count({i,target_overflow})) {
                cout << 1;
            } else {
                cout << 0;
            } 
        }
        cout << "\n";

        lep(i,1,n) {
            dp[i].clear();
        }
    }

    
} 

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/