#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template <typename T> using vc = vector<T>;
template <typename T> using vvc = vector<vector<T>>;
template <typename T> using vvvc = vector<vector<vector<T>>>;
template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;
template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }
template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }

int dx4[] = {1,0,-1,0};
int dy4[] = {0,1,0,-1};

#define overload5(a, b, c, d, e, name, ...) name
#define overload4(a, b, c, d, name, ...) name
#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)
#define REP1(i, n) for(ll i = 0; i < (n); ++i)
#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)
#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)
#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)
#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))
#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)
#define setbits(j, n) for(ll iiiii = (n), j = lowbit(iiiii); iiiii; iiiii ^= 1 << j, j = lowbit(iiiii))
#define perm(v) for(bool permrepflag = true; (permrepflag ? exchange(permrepflag, false) : next_permutation(all(v)));)
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define drop(s) cout << #s << endl, exit(0)
#define si(c) (int)(c).size()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))
#define rng(v, l, r) v.begin() + (l), v.begin() + (r)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define SORT(v) sort(all(v))
#define REV(v) reverse(all(v))
#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))

int inf = 1001001001;

int dp[1 << 10];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vvc<int>ki(n);
    rep(i,n-1) {
        int u,v;
        cin >> u >> v;
        u--;
        v--;
        ki[u].pb(v);
        ki[v].pb(u);
    }
    vc<int>a(n),b(n);
    rep(i,n) {
        cin >> a[i];
    }
    rep(i,n) {
        cin >> b[i];
    }
    vc<int>s(n);
    auto dfs = [&](auto &dfs,int n,int p) -> void {
        for(int i:ki[n]) {
            if(i == p) continue;
            s[i] = s[n]+1;
            dfs(dfs,i,n);
        }
    };
    dfs(dfs,0,-1);
    rep(i,n) {
        if(s[i] <= 10) {
            a[i] = 1 << (10+s[i]);
        }
    }
    rep(i,n) {
        cout << a[i] << ((i+1 == n)?"\n":" ");
    }
    string ans = string(n,'0');
    rep(i,1 << 10) {
        dp[i] = inf;
    }
    stack<vc<pii>>st;
    dp[0] = 0;
    auto dfs2 = [&](auto &dfs2,int n,int p) -> void {
        if(s[n] <= 10) {
            bool f = true;
            rep(j,21) {
                if(1 & (b[n] >> j)) {
                    if(j < 10 || j > 10+s[n]) {
                        f = false;
                        break;
                    }
                }
            }
            if(f) ans[n] = '1';
        }
        else {
            vc<int>ndp(1 << 10,inf);
            vc<pii>now;
            rep(j,1 << 10) {
                int nxt = (j+a[n])%(1 << 10);
                if(dp[nxt] > dp[j]+a[n]) {
                    now.pb({nxt,dp[nxt]});
                }
                chmin(ndp[j],dp[j]);
                chmin(ndp[nxt],dp[j]+a[n]);
            }
            rep(j,1 << 10) {
                dp[j] = ndp[j];
            }
            st.push(now);
            if(dp[b[n]%(1 << 10)] <= b[n]) {
                ans[n] = '1';
            }
        }
        for(int i:ki[n]) {
            if(i == p) continue;
            s[i] = s[n]+1;
            dfs2(dfs2,i,n);
        }
        if(s[n] > 10) {
            auto now = st.top();
            st.pop();
            for(auto i:now) {
                dp[i.fi] = i.se;
            }
        }
    };
    dfs2(dfs2,0,-1);
    cout << ans << "\n";
}