#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 300000 + 5;
const int INF32 = 0x3f3f3f3f;

int N, a[MAX_N], b[MAX_N];
struct Edge{
    int y, prev;
}e[MAX_N << 1];
int elast[MAX_N], ecnt;
int *f[MAX_N], g[512], h[512], sta[MAX_N], fath[MAX_N], dep[MAX_N], tp;
char ans[MAX_N];

void Build(int x, int y) {
    ecnt ++;
    e[ecnt].y = y;
    e[ecnt].prev = elast[x];
    elast[x] = ecnt;
}

void dfs1(int u, int fa, int dep) {
    if (dep <= 11) a[u] = (1 << 20 - dep);
    else return ;
    for (int i = elast[u]; i; i = e[i].prev) {
        int v = e[i].y;
        if (v != fa) {
            dfs1(v, u, dep + 1);
        }
    }
}

void dfs2(int u, int fa, int dep_) {
    dep[u] = dep_;
    fath[u] = fa;
    if (dep_ <= 11) {
        ans[u] = 49;
        for (int i = 0; i < 20 - dep_; i ++)
            if (b[u] >> i & 1) {
                ans[u] = 48;
                break;
            }
    }else {
        memcpy(g, f[sta[tp]], sizeof g);
        int node[10], n = 0;
        node[n ++] = u;
        if (tp) {
            int v = fa;
            while (v != sta[tp]) {
                node[n ++] = v;
                v = fath[v];
            }
        }
        for (int j = 0; j < n; j ++) {
            int x = node[j];
            int minv = a[x] & 511;
            memcpy(h, g, sizeof h);
            for (int i = 511; i >= minv; i --) {
                h[i] = min(h[i], g[i - minv] + a[x]);
            }
            for (int i = minv - 1; i >= 0; i --) {
                h[i] = min(h[i], g[i + 512 - minv] + a[x]);
            }
            memcpy(g, h, sizeof h);
        }
        if (g[b[u] & 511] <= b[u]) ans[u] = 49;
        else ans[u] = 48;
        if (!tp || dep_ - dep[sta[tp]] > 5) {
            sta[++ tp] = u;
            f[u] = new int[512];
            memcpy(f[u], g, sizeof g);
        }
    }
    for (int i = elast[u]; i; i = e[i].prev) {
        int v = e[i].y;
        if (v != fa) {
            dfs2(v, u, dep_ + 1);
        }
    }
    if (sta[tp] == u) delete f[sta[tp --]];
}

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

    f[0] = new int[512];
    memset(f[0], 0x3f, sizeof(int) * 512);
    f[0][0] = 0;

    cin >> N;
    for (int i = 1; i < N; i ++) {
        int x, y;
        cin >> x >> y;
        Build(x, y);
        Build(y, x);
    }
    for (int i = 1; i <= N; i ++) cin >> a[i];
    for (int i = 1; i <= N; i ++) cin >> b[i];
    
    dfs1(1, 0, 0);
    for (int i = 1; i <= N; i ++) cout << a[i] << "\n "[i < N];
    dfs2(1, 0, 0);
    cout << (ans + 1) << '\n';

    return 0;
}