#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
#define fi first
#define se second
#define all1(x) (x).begin() + 1, (x).end()
typedef pair<int, int> pi;


int main() {
    int n; cin >> n;
    V<V<int>> e(n + 1);
    V<int> dep(n + 1);
    V<int> f(n + 1);
    auto dfs = [&](int x, int p, auto dfs) -> void {
        f[x] = p;
        dep[x] = 1;
        for(auto y : e[x]) {
            if(y == p) continue;
            dfs(y, x, dfs);
            dep[x] = max(dep[y] + 1, dep[x]);
        }
    };
    for(int i = 1; i < n; i++) {
        int a, b; cin >> a >> b;
        e[a].pb(b), e[b].pb(a);
    }
    dfs(1, 0, dfs);

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

    priority_queue<pi> pq;
    pq.push({dep[1], 1});
    
    for(int i = 1; i <= min(n, 5000); i++) {
        auto [_, x] = pq.top();
        // cout << "need : " << _ << " " << "x : " << x << endl;
        pq.pop();
        if(x == 1) a[x] = 1;
        else a[x] = min((int)2e6, a[f[x]] * 2);
        for(auto y : e[x]) {
            if(y == f[x]) continue;
            int tmp = min(dep[y], (int)1e6 / a[x] / 2);
            pq.push({tmp, y});
        }
    }

    auto mer = [&](V<pi> a, int x) -> V<pi> {
        V<pi> ans;
        int l = 0, r = 0;
        while(l != a.size() || r != a.size()) {
            int to_l, to_r;
            if(r == a.size() || (l != a.size() && a[l].fi < a[r].fi + x)) {
                to_l = a[l].fi, to_r = a[l].se;
                l++;
            } else {
                to_l = a[r].fi + x, to_r = a[r].se + x;
                r++;
            }
            if(ans.empty() || ans.back().se < to_l - 1) {
                if(to_l < 2e6) ans.pb({to_l, min((int)2e6, to_r)});
            } else {
                ans.back().se = min((int)2e6, max(ans.back().se, to_r));
            }
        }
        return ans;
    };

    V<int> ans(n + 1);
    V<V<pi>> dp(n + 1);

    auto cal = [&](int x, int p, auto dfs) -> void {
        // cout << "done : " << x << endl;
        dp[x] = mer(dp[p], a[x]);
        for(auto [l, r] : dp[x]) {
            if(l <= b[x] && r >= b[x]) ans[x] = 1;
        }
        for(auto y : e[x]) {
            if(y == p) continue;
            // cout << "wtf : " << y << endl;
            dfs(y, x, dfs);
        }
    };
    dp[0] = {{0, 0}};
    cal(1, 0, cal);

    for(int i = 1; i <= n; i++) {
        // cout << "i : " << i << endl;
        // for(auto [l, r] : dp[i]) cout << l << " " << r << endl;
        // assert(dp[i].size() < 50);
    }
    // for(int i = 1; i <= n; i++) cout << dep[i] << " ";
    // cout << endl;

    for(int i = 1; i <= n; i++) cout << a[i] << " ";
    cout << endl;
    for(int i = 1; i <= n; i++) cout << ans[i];
    cout << endl;
}