// https://www.youtube.com/watch?v=wthasN45KuY
// You said I’d fly away
// But my walls have kept me down
// Now I’m lost and I’m afraid
// And I’m close to hit the ground
// 
// You said I’d fly away
// You said I’d fly anywhere
// But I keep on Falling

#ifndef ONLINE_JUDGE
#include "templates/debug.hpp"
#else
#define debug(...)
#endif

#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;

// #define int i64
void solve() {
    int n; cin >> n;
    vector<vector<int>> adj(n);
    for (int e = 1; e < n; e++) {
        int u, v; cin >> u >> v;
        u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    constexpr int W = 21, B = 12, M = 1 << (W - B);
    vector<int> dp(M, 1 << W);
    dp[0] = 0;
    vector<int> dep(n);
    vector<int> ans(n);
    function<void(int, int)> dfs = [&](int u, int p) {
        vector<pair<int, int>> changes;
        if (dep[u] < B) {
            a[u] = 1 << (W - dep[u] - 1);
            ans[u] = (b[u] % a[u] == 0);
        } else {
            vector old = dp;
            for (int i = 0; i < M; i++) {
                int new_dp = old[i] + a[u], ni = (i + a[u]) % M;
                if (new_dp < dp[ni]) {
                    dp[ni] = new_dp;
                    changes.emplace_back(ni, old[ni]);
                }
            }
            ans[u] = (b[u] >= dp[b[u] % M]);
        }
        for (int v : adj[u]) {
            if (v != p) {
                dep[v] = dep[u] + 1;
                dfs(v, u);
            }
        }
        ranges::reverse(changes);
        for (auto [i, oi]: changes) {
            dp[i] = oi;
        }
    };
    dfs(0, -1);
    for (int i = 0; i < n; i++) cout << a[i] << " ";
    cout << "\n";
    for (int i = 0; i < n; i++) {
        if (ans[i]) cout << "1";
        else cout << "0";
    }
    cout << "\n";
}
#undef int

// Make bold hypotheses and verify carefully
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}