#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define sz(a) ((int) (a).size())
#define pb emplace_back
#define me(a, x) memset(a, x, sizeof(a))
#define vi vector<int>
#define ull unsigned long long
using namespace std;
const int N = 3e5 + 7, mod = 1e9 + 7;
int n;
int a[N];
int b[N];
vector<pair<int,int>>dp[N];
int ch[N][2];
vi e[N];
int dep[N];
bool ans[N];
int siz[N];
void dfs1(int x, int fa = 0) {
	siz[x]=1;
	vi son;
	for(auto&v : e[x]) if(v != fa) {
		son.pb(v);
	}
	swap(e[x], son), son.shrink_to_fit();
	for(auto&v : e[x])dfs1(v, x),siz[x]+=siz[v];
	sort(e[x].begin(),e[x].end(),[&](int u,int v){
		return siz[u]<siz[v];
	});
}
void dfs(int x) {
	if(dep[x] <= 11) {
		a[x] = 1 << dep[x];
	}
	vector<pair<int,int>>vp;
	int l = 0, r = 0;
	while(l < sz(dp[x]) || r < sz(dp[x])) {
		pair<int,int>u;
		if(l < sz(dp[x]) && (r == sz(dp[x]) || dp[x][l].first <= dp[x][r].first + a[x])) {
			u = dp[x][l++];
		} else{
			u = dp[x][r++];
			u.first += a[x];
			u.second += a[x];
		}
		if(u.first > 3e6)continue;
		u.second = min(u.second, (int)3e6);
		if(sz(vp) && vp.back().second >= u.first - 1) {
			vp.back().second = max(vp.back().second, u.second);
		} else {
			vp.pb(u);
		}
	}
	swap(vp, dp[x]);
	vp.clear(),vp.shrink_to_fit();
	// cout << x << " : " << sz(dp[x]) << endl;
	for(auto&u : dp[x]) {
		if(u.first <= b[x] && b[x] <= u.second) {
			ans[x] = 1;
		}
	}
	int c=sz(e[x]);
	for(auto&v : e[x]) {
		dep[v] = dep[x] + 1;
		--c;
		if(!c)swap(dp[x],dp[v]);
		else dp[v]=dp[x];
		dfs(v);
	}
	dp[x].clear();
	dp[x].shrink_to_fit();
}
mt19937 rng;
const int mx = 3e6;
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	L(i, 1, n - 1) {
		int u, v;
		cin >> u >> v;
		e[u].pb(v);
		e[v].pb(u);
	}
	// n=3e4;
	// L(i,2,n){
	// 	if(i >= 10000) {
	// 		e[i-1].pb(i);
	// 	}else {
	// 		e[i/2].pb(i);
	// 	}
	// }
	dp[1].pb(0, 0);
	L(i, 1, n) {
		// a[i] = rng() % mx + 1;
		cin >> a[i];
	}
	L(i, 1, n) {
		// b[i] = rng() % mx + 1;
		cin >> b[i];
	}
	dfs1(1);
	dfs(1);
	// cout << clock() << ' ' << sz(dp[20000]) << endl;
	L(i, 1, n) {
		cout << a[i] << " \n"[i == n];
	}
	L(i, 1, n) cout << ans[i];
	cout << '\n';
	return 0;
}