#include <bits/stdc++.h>

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

constexpr int inf = 2E6 + 1;
constexpr int B = 11;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;
    
    std::vector<std::vector<int>> adj(n);
    for (int i = 1; i < n; i++) {
        int u, v;
        std::cin >> u >> v;
        u--;
        v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    
    std::vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        std::cin >> b[i];
    }
    
    std::vector<int> dep(n);
    std::vector<bool> ans(n);
    std::vector dp(1 << (20 - B), inf);
    dp[0] = 0;
    std::vector<std::pair<int, int>> his;
    auto dfs = [&](auto self, int x, int p) -> void {
        int t = his.size();
        if (dep[x] <= B) {
            a[x] = 1 << (20 - dep[x]);
            ans[x] = (b[x] % a[x] == 0);
        } else {
            t = his.size();
            std::vector<int> old {dp};
            for (int i = 0; i < (1 << (20 - B)); i++) {
                int j = (i + a[x]) % (1 << (20 - B));
                int v = old[i] + a[x];
                if (v < dp[j]) {
                    his.emplace_back(j, dp[j]);
                    dp[j] = v;
                }
            }
            ans[x] = (b[x] >= dp[b[x] % (1 << (20 - B))]);
        }
        for (auto y : adj[x]) {
            if (y == p) {
                continue;
            }
            dep[y] = dep[x] + 1;
            self(self, y, x);
        }
        while (his.size() > t) {
            auto [x, y] = his.back();
            his.pop_back();
            dp[x] = y;
        }
    };
    dfs(dfs, 0, -1);
    
    for (int i = 0; i < n; i++) {
        std::cout << a[i] << " \n"[i == n - 1];
    }
    for (int i = 0; i < n; i++) {
        std::cout << ans[i];
    }
    std::cout << "\n";
    
    return 0;
}