#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ; 
typedef vector<int> vi;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1007 ;
const int MAXK = 57 ;

vector < ll > dp[ MAXN ][ MAXK ] ;
vector < ll > nw[ MAXK ] ;

int n , k ;
ll l , r ;
ll a[ MAXN ] ;
int cnt[ MAXN ] ;
vector < int > v[ MAXN ] ;
map < ll , ll > mn , mx ;

void opt ( vector < ll > &aux ) {
    mn.clear ( ) , mx.clear ( ) ;
    ll len = r - l + 1 ;
    for ( auto x : aux ) {
        if ( mn.find ( x / len ) == mn.end ( ) ) {
            mn[ x / len ] = x ;
        }
        if ( mn[ x / len ] > x ) { mn[ x / len ] = x ; }
        if ( mx[ x / len ] < x ) { mx[ x / len ] = x ; }
    }
    aux.clear ( ) ;
    for ( auto e : mn ) {
        aux.push_back ( e.se ) ;
        if ( e.se != mx[ e.fi ] ) {
            aux.push_back ( mx[ e.fi ] ) ;
        }
    }
}

void dfs ( int x , int prv ) {
    dp[ x ][ 0 ].push_back ( a[ x ] ) ;
    cnt[ x ] = 0 ;
    for ( auto y : v[ x ] ) {
        if ( y == prv ) { continue ; }
        dfs ( y , x ) ;
        for ( int i = 0 ; i <= k ; ++ i ) {
            nw[ i ].clear ( ) ;
        }
        for ( int i = 0 ; i <= cnt[ x ] ; ++ i ) {
            for ( int j = 0 ; j <= cnt[ y ] ; ++ j ) {
                if ( i + j > k ) { break ; }
                for ( auto val1 : dp[ x ][ i ] ) {
                    for ( auto val2 : dp[ y ][ j ] ) {
                        if ( val1 + val2 <= r ) { 
                            nw[ i + j ].push_back ( val1 + val2 ) ;
                        }
                    }
                }
            }
        }
        for ( int i = 0 ; i <= k ; ++ i ) {
            dp[ x ][ i ].clear ( ) ;
            opt ( nw[ i ] ) ;
            for ( auto val : nw[ i ] ) {
                dp[ x ][ i ].push_back ( val ) ;
            }
        }
        cnt[ x ] += cnt[ y ] ;
        if ( cnt[ x ] > k ) { cnt[ x ] = k ; }
    }
    ++ cnt[ x ] ;
    if ( cnt[ x ] > k ) { cnt[ x ] = k ; }
    for ( int i = k ; i >= 0 ; -- i ) {
        for ( auto val : dp[ x ][ i ] ) {
            if ( l <= val && val <= r ) {
                if ( x != 1 ) {
                    dp[ x ][ i + 1 ].push_back ( 0 ) ;
                }
                else {
                    dp[ x ][ i ].push_back ( 0 ) ;
                }
                break ;
            }
        }
    }
}

void solve ( ) {
    cin >> n >> k >> l >> r ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> a[ i ] ;
        v[ i ].clear ( ) ;
        for ( int j = 0 ; j <= k ; ++ j ) {
            dp[ i ][ j ].clear ( ) ;
        }
    }
    for ( int i = 1 , x , y ; i < n ; ++ i ) {
        cin >> x >> y ;
        v[ x ].push_back ( y ) ;
        v[ y ].push_back ( x ) ;
    }
    dfs ( 1 , -1 ) ;
    for ( int i = 0 ; i <= k ; ++ i ) {
        bool fl = false ;
        for ( auto x : dp[ 1 ][ i ] ) {
            if ( x == 0 ) {
                fl = true ;
                break ;
            }
        }
        if ( fl == true ) { cout << "1" ; }
        else { cout << "0" ; }
    }
    cout << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}