#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vi=vector<int>;
template<class T> using oset =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
//上
const int N =2000000;
int depth[300010];
vector<bitset<42>> stk[300010];
vector<int> ans;
bitset<42> bt;
int X,Y;
vector<pair<int,int>> su(int x,vector<pair<int,int>> &dp){
    vector<pair<int,int>> ne;
    vector<pair<int,int>> mrg;
    for(auto &u: dp){
        if(u.first +x  >N) continue;
        if(u.second +x  >N){
            ne.push_back({u.first+x,N});
        }else ne.push_back({u.first+x,u.second+x});
    }

    int p1 = 0;
    int p2 = 0;
    int l = 0;
    int r = 0;
    while(p1 <dp.size() || p2 < ne.size()){
        if(p1 < dp.size() &&dp[p1].first <= r+1){
            r = max(r,dp[p1].second);
            p1++;
        }else if(p2 < ne.size() && ne[p2].first <= r+1){
            r = max(r,ne[p2].second);
            p2++;
        }else{
            mrg.push_back({l,r});
            l= N+1;
            if(p1 <dp.size()) l = min(dp[p1].first,l);
            if(p2 <ne.size()) l = min(ne[p2].first,l);
            r = l;
        }
    }
    if(l != N+1) mrg.push_back({l,r});
        
    return mrg;
}
vector<pair<int,int>> complement(vector<pair<int,int>> &a){
    vector<pair<int,int>> comp;
    if(a.size() == 0){
        return {{0,N}};
    }
        int l = 0;
        if(a[0].first != l){
            comp.push_back({0,a[0].first-1});
        }
        l = a[0].second+1;
        for(int i = 1; i < a.size();i++){
            comp.push_back({l,a[i].first-1});
            l = a[i].second+1;
        }
        if(l <=N) comp.push_back({l,N});
    
    return comp;
}
vector<pair<int,int>> intersect(vector<pair<int,int>> a,vector<pair<int,int>> &b){
    vector<pair<int,int>> inter;
    int p1 = 0;
    for(int i = 0; i < a.size();i++){
        while(p1<b.size()){
            if(b[p1].second<= a[i].second){
                if(max(a[i].first,b[p1].first)<=min(a[i].second,b[p1].second)){
                    inter.push_back({max(a[i].first,b[p1].first),min(a[i].second,b[p1].second)});
                }
                p1++;
            }else{
                if(max(a[i].first,b[p1].first)<=min(a[i].second,b[p1].second)){
                    inter.push_back({max(a[i].first,b[p1].first),min(a[i].second,b[p1].second)});
                }
                break;
            }
        }
    }
    return inter;
}
void dfs(int x,int p,vector<vector<int>> &AL){
    for(auto &u: AL[x]){
        if(u == p) continue;
        depth[u] = depth[x]+1;
        dfs(u,x,AL);
    }
}
void dfs1(int x,int p,vector<vector<int>> &AL,vector<int> &a,vector<int> &b,vector<pair<int,int>> &dp){
    vector<pair<int,int>> comp = complement(dp);
    dp = su(a[x],dp);
    for(auto &u: dp){
        if(u.first <= b[x] && b[x]<=u.second){
            ans[x] = 1;
        }
    }
    comp = intersect(dp,comp);
    for(auto &u:comp){
        
        for(int i = 0; i <21; i++){
            if(u.first&(1<<i)){
                bt[i] = 1;
            }else bt[i] = 0;
        }
        for(int i = 0; i <21; i++){
            if(u.second&(1<<i)){
                bt[i+21] = 1;
            }else bt[i+21] = 0;
        }
        stk[depth[x]].push_back(bt);
    }
    
    comp.clear();
    for(auto &u: AL[x]){
        if(u == p) continue;
        dfs1(u,x,AL,a,b,dp);
    }
    for(auto &u: stk[depth[x]]){
        X = 0, Y= 0;
        for(int i = 0; i <21; i++) if(u[i]) X^=(1<<i);
        for(int i = 0; i <21; i++) if(u[i+21]) Y^=(1<<i);
        comp.push_back({X,Y});
    }
    
    dp = intersect(complement(comp),dp);
    stk[depth[x]].clear();
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> b(n);
    vector<vector<int>> AL(n);
    FOR(i,0,n-1){
        int a,b;
        cin >> a >> b;
        AL[a-1].push_back(b-1);
        AL[b-1].push_back(a-1);
    }
    FOR(i,0,n) cin >> a[i];
    FOR(i,0,n) cin >> b[i];
    vector<int> pot(13);
    pot[0] = 1;
    for(int i = 1; i <13;i++) pot[i] = pot[i-1]*2;
    ans.resize(n);
    depth[0] = 0;
    dfs(0,-1,AL);
    vector<pair<int,int>> dp = {{0,0}};
    for(int i = 0; i < n; i++) if(depth[i] < 12) a[i] = pot[depth[i]];
    dfs1(0,-1,AL,a,b,dp);
    for(auto &u: a) cout <<u<<" ";
    cout <<'\n';
    for(auto &u: ans) cout <<u;
    cout <<'\n';
}