#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int adj[300'004][3];
int a[300'004];
int b[300'004];
int z[300'004];
bitset<300'004> ans;
bitset<300'004> islo;
int maxb=2'000'001;

void prescan(int loc,int dad, int dep){
	if(dep<=11){
		a[loc]=1<<dep;
		ans[loc]=b[loc]<(2<<dep);
		islo[loc]=1;
	}
	z[loc]=1;
	for(int con : adj[loc])if(con!=dad && con!=-1){
		prescan(con,loc,dep+1);
		z[loc]+=z[con];
	}
};

void dfs(int loc,int dad,vi* starters){
	if(loc==-1) return;
	int big = -1;
	int smol = -1;
	for(int con : adj[loc])if(con!=dad && con!=-1){
		if(big==-1 || z[con]>z[big]){
			smol=big;
			big=con;
		}else smol=con;
	}
	if(!islo[loc]){
		int existing = starters->size();
		rep(i,0,existing)if((*starters)[i]+a[loc]<=maxb)starters->pb((*starters)[i]+a[loc]);
		inplace_merge(starters->begin(), starters->begin()+existing, starters->end());
		int last = 1;
		rep(i,2,sz(*starters)){
			if((*starters)[last-1]+4096>(*starters)[i]){
				(*starters)[last]=(*starters)[i];
			}else{
				(*starters)[++last]=(*starters)[i];
			}
		}
		starters->resize(last+1);

		int ind = upper_bound(all(*starters), b[loc]) - starters->begin() - 1;
		ans[loc]=(*starters)[ind]+4096>b[loc];
	}
	// cout<<loc<<": ";
	// rep(i,0,sz(*starters))cout<<(*starters)[i]<<' ';
	// cout<<endl;
	if(smol!=-1){
		vi* alt = new vi(all(*starters));
		dfs(smol,loc,alt);
		delete alt;
	}
	return dfs(big,loc,starters);
};

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int n;cin>>n;
	rep(i,0,n)rep(j,0,3)adj[i][j]=-1;
	rep(_,0,n-1){
		int a,b;cin>>a>>b;a--;b--;
		int ai=0;
		while(adj[a][ai]!=-1)ai++;
		int bi=0;
		while(adj[b][bi]!=-1)bi++;
		adj[a][ai]=b;
		adj[b][bi]=a;
	}
	rep(i,0,n)cin>>a[i];
	rep(i,0,n)cin>>b[i];
	prescan(0,0,0);
	vi* base = new vi;
	base->pb(0);
	dfs(0,0,base);
	delete base;
	rep(i,0,n)cout<<a[i]<<' ';
	cout<<'\n';
	rep(i,0,n)cout<<ans[i];
	cout<<'\n';

}