#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;

mt19937 rng(time(NULL));

const int N=300001,M=2e6;
vector<pair<int,int>> add(vector<pair<int,int>> &in,int t){
	vector<pair<int,int>> ans,fin;
	int i=0,j=0;
	while(j<sz(in)){
		if(i<sz(in)){
			if(in[j].f+t<in[i].f){
				ans.pb({in[j].f+t,in[j].s});
				j++;
			}
			else{
				ans.pb(in[i]);
				i++;
			}
		}
		else{
			if(in[j].f+t>M)break;
			ans.pb({in[j].f+t,in[j].s});
			j++;
		}
	}
	for(int i=sz(ans)-1;i>=0;i--){
		if(i){
			assert(ans[i].f>=ans[i-1].f);
		}
		int en=ans[i].f+ans[i].s;
		while(sz(fin)&&fin.back().f<=en){
			en=max(en,fin.back().f+fin.back().s);
			fin.pop_back();
		}
		fin.pb({ans[i].f,en-ans[i].f});
	}
	reverse(all(fin));
	for(int i=0;i<sz(fin)-1;i++){
		assert(fin[i].f+fin[i].s<fin[i+1].f);
	}
	return fin;
}
vector<vector<int>> graf(N);
vector<vector<pair<int,int>>> roll;
vector<pair<int,int>> current;
void print(vector<pair<int,int>> &t){
	printf("Current:");
	for(auto p:t){
		printf(" [%i - %i]",p.f,p.f+p.s-1);
	}
	printf("\n");
}
bool ima(vector<pair<int,int>> &t,int x){
	//print(t);
	//printf("Trazim %i\n",x);
	pair<int,int> target={x,INT_MAX};
	auto it=upper_bound(all(t),target);
	if(it==t.begin())return 0;
	it--;
	pair<int,int> my=*it;
	//printf("My: %i %i\n",my.f,my.s);
	assert(my.f<=x);
	return my.f+my.s>x;
}
vector<int> siz(N);
vector<int> a(N),b(N);
vector<bool> ans(N);
const int H=12;
void dfss(int tr,int par,int ht,int vl){
	if(ht<=H){
		a[tr]=vl;
	}
	for(auto p:graf[tr]){
		if(p!=par){
			dfss(p,tr,ht+1,vl*2);
			siz[tr]+=siz[p];
		}
	}
	siz[tr]++;
}
void solve(int tr,int par,int ht){
	if(ht<=H){
		int mozeDo=2*a[tr]-1;
		ans[tr]=(b[tr]<=mozeDo);
	}
	if(ht==H){
		current={{0,2*a[tr]}};
	}
	if(ht>H){
		current=add(current,a[tr]);
		//printf("%i:\n",tr);
		//print(current);
		ans[tr]=ima(current,b[tr]);
	}
	vector<pair<int,int>> deca;
	for(auto p:graf[tr]){
		if(p!=par){
			deca.pb({siz[p],p});
		}
	}
	//sort(all(deca));
	if(sz(deca)==0){
		return;
	}
	if(sz(deca)==1){
		solve(deca[0].s,tr,ht+1);
	}
	else if(sz(deca)==2){
		roll.pb(current);
		solve(deca[0].s,tr,ht+1);
		current=roll.back();
		roll.pop_back();
		solve(deca[1].s,tr,ht+1);
	}
	else{
		//printf("%i!\n",sz(deca));
		assert(0);
	}
}
int main()
{
	ios;
	int n;
	cin >> n;
	for(int i=1;i<n;i++){
		int u,v;
		cin >> u >> v;
		u--;v--;
		graf[u].pb(v);
		graf[v].pb(u);
	}
	for(int i=0;i<n;i++)cin >> a[i];
	for(int i=0;i<n;i++)cin >> b[i];
	dfss(0,0,1,1);
	solve(0,0,1);
	for(int i=0;i<n;i++){
		printf("%i ",a[i]);
	}
	printf("\n");
	for(int i=0;i<n;i++){
		printf(ans[i]?"1":"0");
	}
	printf("\n");
	return 0;
}