#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
using LL = long long;
const int maxn = 3e5 + 5;
vector<int> g[maxn];
int dep[maxn];
int a[maxn], b[maxn], fa[maxn], ans[maxn];
int cnt;
vector<pair<int, int> > p[31];

int sz[maxn];

void dfs_sz(int u){
    for(auto it = g[u].begin(); it != g[u].end(); it++){
        if (*it == fa[u]){
            g[u].erase(it);
            break;
        }
    }
    sz[u] = 1;
    for(auto &j : g[u]){
        dep[j] = dep[u] + 1;
        fa[j] = u;
        dfs_sz(j);
        sz[u] += sz[j];
        if (sz[j] > sz[g[u][0]]) swap(j, g[u][0]);
    }
}

void dfs(int u){
    if (dep[u] <= 12){
        a[u] = 1 << (dep[u] - 1);
        ans[u] = (b[u] < (1 << dep[u]));
        p[cnt] = {{0, (1 << dep[u]) - 1}};
    }
    else{
        vector<pair<int, int> > tmp;
        for(auto [l, r] : p[cnt]){
            l += a[u];
            r += a[u];
            r = min(r, (1 << 21) - 1);
            if (l <= r) tmp.push_back({l, r});
        }
        vector<pair<int, int> > q(tmp.size() + p[cnt].size());
        merge(tmp.begin(), tmp.end(), p[cnt].begin(), p[cnt].end(), q.begin());
        p[cnt].clear();
        for(auto [l, r] : q){
            if (p[cnt].empty() or l > p[cnt].back().second + 1){
                p[cnt].push_back({l, r});
            }
            else{
                p[cnt].back().second = max(p[cnt].back().second, r);
            }
        }
        for(auto [l, r] : p[cnt]){
            if (b[u] >= l and b[u] <= r){
                ans[u] = 1;
                break;
            }
        }
    }
    for(int i = 1; i < g[u].size(); i++){
        int j = g[u][i];
        ++cnt;
        assert(cnt <= 30);
        p[cnt] = p[cnt - 1];
        dfs(j);
        --cnt;
    }
    if (!g[u].empty()) dfs(g[u][0]);
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) cin >> b[i];
    dep[1] = 1;
    dfs_sz(1);
    p[0] = {{0, 0}};
    dfs(1);
    for(int i = 1; i <= n; i++){
        cout << a[i] << " \n"[i == n];
    }
    for(int i = 1; i <= n; i++){
        cout << ans[i];
        char c;
        cin >> c;
        // if (ans[i] != c - '0'){
        //     cout << '\n' << i << '\n';
        //     return 0;
        // }
    }
    cout << '\n';

}