#include<bits/stdc++.h>
using namespace std;
#define ff       first
#define ss       second
#define MX       100005
#define mod      1000000007
#define ll       long long
#define pb       push_back
#define pll      pair<ll,ll>
#define endl     "\n"
#define bug(a)   cerr<<#a<<" : "<<a<<endl
#define all(x)   (x).begin(),(x).end()
#define allr(x)  (x).rbegin(),(x).rend()
#define Mul(a,b) (a%mod * b%mod)%mod
#define Add(a,b) (a%mod + b%mod)%mod

ll vis[MX], a[MX], val[MX];
vector<ll>adj[MX];

void dfs(ll src) {
    vis[src] = 1;
    for(auto it: adj[src]) {
        if(!vis[it]) {
            val[it]+=val[src];
            dfs(it);
        }
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    ll t;
    cin>>t;
    for(int tc=1; tc<=t; tc++) {
        ll n, q;
        cin>>n>>q;

        for(int i=1; i<=n; i++) {
            cin>>a[i];
        }

        for(int i=1; i<=n-1; i++) {
            ll u,v;
            cin>>u>>v;
            adj[u].pb(v);
            adj[v].pb(u);
        }

        while(q--) {
            ll x; cin>>x;
            val[x]++;
        }

        dfs(1);

        cout<<"Case "<<tc<<": ";
        for(int i=1; i<=n; i++) {
            if(val[i]%2==0) cout<<a[i]<<" ";
            else cout<<(a[i]^1)<<" ";
        }
        cout<<endl;

        for(int i=1; i<=n; i++) {
            vis[i]=0;
            val[i]=0;
            adj[i].clear();
        }
    }

    return 0;
}