#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using ll = long long;

using namespace std;

const int MAX_LOG = 20, MAX_D = 11, INF = 1e9, N = 1 << (MAX_LOG - MAX_D);

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int n;
    cin >> n;
    vector<vector<int>> G(n);
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }
    vector<int> a(n), b(n);
    cin >> a >> b;

    vector<bool> ans(n);
    vector<int> dp(N, INF);
    dp[0] = 0;
    auto dfs = [&](auto self, int v, int p, int d) -> void {
        vector<tuple<int, int, int>> update;
        if (d <= MAX_D) {
            a[v] = 1 << (MAX_LOG - d);
            ans[v] = (b[v] % a[v] == 0);
        } else {
            int x = a[v] % N;
            for (int i = 0; i < N; i++) {
                int j = i + x;
                if (j >= N) j -= N;
                if (dp[i] + a[v] < dp[j]) update.emplace_back(j, dp[j], dp[i] + a[v]);
            }
            for (auto [i, tmp, val] : update) dp[i] = val;
            ans[v] = (dp[b[v] % N] <= b[v]);
        }
        for (int& u : G[v]) {
            if (u == p) continue;
            self(self, u, v, d + 1);
        }
        for (auto [i, val, tmp] : update) dp[i] = val;
    };
    dfs(dfs, 0, -1, 0);

    cout << a << "\n";
    for (int i = 0; i < n; i++) cout << (ans[i] ? '1' : '0');
    cout << "\n";
    return 0;
}