#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}


const ll INF = 2e18;
const int INFi = 1e9;
const int N = 3e5 + 5;
const int LG = 20;

vi g[N];
int h[N];
int a[N], b[N];
int sz[N];

void dfs_h(int v) {
    sz[v] = 1;
    for(auto &u : g[v]) {
        g[u].erase(std::find(g[u].begin(), g[u].end(), v));
        h[u] = h[v] + 1;
        dfs_h(u);
        sz[v] += sz[u];
    }
    sort(all(g[v]), [&] (const int &i, const int &j) { return sz[i] < sz[j]; });
}

vector<vector<pair<int, int>>> dp;
vector<pair<int, int>> nxt;

const int MX = 2e6 + 5;

void Add(int l, int r) {
    r = min(r, MX);
    if (l >= r) return;
    if (nxt.empty() || nxt.back().second < l) nxt.emplace_back(l, r);
    ckmax(nxt.back().second, r);
}

int ans[N];
void dfs_solve(int v) {
    if (a[v] != 0 && (dp.back().size() >= 2 || dp.back().back().second != MX)) {
        int j = 0;
        for (auto &[l, r]: dp.back()) {
            while (j != dp.back().size() && dp.back()[j].first + a[v] < l) {
                Add(dp.back()[j].first + a[v], dp.back()[j].second + a[v]);
                j++;
            }
            Add(l, r);
        }
        while (j != dp.back().size()) {
            Add(dp.back()[j].first + a[v], dp.back()[j].second + a[v]);
            j++;
        }
        dp.back() = nxt;
        nxt.clear();
    }
    for(auto &[l, r] : dp.back()) {
        if (l <= b[v] && b[v] < r) {
            ans[v] = 1;
        }
    }

    for(auto &u : g[v]) {
        if (u != g[v].back()) {
            dp.push_back(dp.back());
        }
        dfs_solve(u);
        if (u != g[v].back()) {
            dp.pop_back();
        }
    }
}

void solve() {
    int n; cin >> n;
    rep(_, n - 1) {
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= n; ++i) cin >> b[i];
    dfs_h(1);
    vi ord(n);
    iota(all(ord), 1);
    sort(all(ord), [&] (const int &i, const int &j) { return h[i] < h[j]; });
    ord.resize(min(n, 5000));
    rep(i, ord.size()) {
        int v = ord[i];
        if (h[v] >= 21) {
            a[v] = 0;
            continue;
        }
        a[v] = (1 << h[v]);
    }
    dp.emplace_back();
    dp.back().emplace_back(0, 1);
    dfs_solve(1);
    for(int i = 1; i <= n; ++i) {
        cout << a[i] << ' ';
    }
    cout << '\n';
    for(int i = 1; i <= n; ++i) {
        cout << ans[i];
    }
    cout << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
//    cin >> t;
    rep(i, t) {
        solve();
    }
//    cout << sizeof(a) / 1'000'000 << '\n';
    return 0;
}