#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
const int maxm = 2e5 + 5;
const short inf = (1 << 12);
int n, a[maxn], b[maxn], dep[maxn], ans[maxn], id[maxn], cnt, cson[maxn];
vector<int> e[maxn];
short f[512][maxm], g[512];
void dfs_pre(int u, int from) {
	for(int v : e[u]) {
		if(v == from) {
			continue;
		}
		cson[u]++;
		dep[v] = dep[u] + 1;
		dfs_pre(v, u);
	}
}
void dfs(int u, int from) {
	for(int i = 0; i < 512; i++) {
		g[i] = f[i][id[u]];
	}
	for(int i = 0; i < 512; i++) {
		if(f[i][id[u]] == inf) {
			continue;
		}
		int val = i + ((int)f[i][id[u]] << 9) + a[u];
		if((val >> 9) <= inf) {
			g[val & 511] = min(g[val & 511], (short)(val >> 9));
		}
	}
	for(int i = 0; i < 512; i++) {
		f[i][id[u]] = g[i];
	}
	if(dep[u] > 11) {
		ans[u] = (f[b[u] & 511][id[u]] <= (b[u] >> 9));
	}
	else if(b[u] % 512 == 0) {
		ans[u] = 1;
		for(int i = dep[u] + 1; i <= 11; i++) {
			if(b[u] >> (20 - i) & 1) {
				ans[u] = 0;
			}
		}
	}
	for(int v : e[u]) {
		if(v == from) {
			continue;
		}
		if(cson[u] == 1) {
			id[v] = id[u];
		}
		else {
			id[v] = ++cnt;
			for(int i = 0; i < 512; i++) {
				f[i][id[v]] = f[i][id[u]];
			}
		}
		dfs(v, u);
		if(cson[u] == 2) {
			cnt--;
		}
	}
}
int main(){
//    freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for(int i = 1, u, v; i < n; i++) {
		cin >> u >> v;
		e[u].push_back(v);
		e[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_pre(1, 0);
	for(int i = 1; i <= n; i++) {
		if(dep[i] <= 11) {
			a[i] = (1 << (20 - dep[i]));
		}
	}
	id[1] = ++cnt;
	for(int i = 0; i < 512; i++) {
		f[i][cnt] = inf;
	}
	f[0][cnt] = 0;
	dfs(1, 0);
	for(int i = 1; i <= n; i++) {
		cout << a[i] << ' ';
	}
	cout << '\n';
	for(int i = 1; i <= n; i++) {
		cout << ans[i];
	}
	return 0;
}