#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define D(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
using LL=long long;
const int N=300005;
int n,a[N],b[N],dep[N],cnt[N],sz[N],son[N],ans[N];
vector<int>e[N];
vector<int>A[N];
int maxd;
void dfs1(int u,int ft){
	dep[u]=dep[ft]+1;
	sz[u]=1;
	for(auto&x:e[u])if(x!=ft){
		dfs1(x,u);
		sz[u]+=sz[x];
		if(sz[x]>sz[son[u]])son[u]=x;
	}
}
void push(vector<int>&A,int x,int d){
	int i=0,j=0;
	vector<int>ret;
	while(i<SZ(A)||j<SZ(A)){
		if(i<SZ(A)&&(j>=SZ(A)||A[i]<A[j]+x)){
			if(SZ(ret)>1&&ret[SZ(ret)-2]+d>=A[i])ret.pop_back();
			if(SZ(ret)&&ret.back()==A[i])ret.pop_back();
			ret.pb(A[i++]);
		}else{
			if(SZ(ret)>1&&ret[SZ(ret)-2]+d>=A[j]+x)ret.pop_back();
			if(SZ(ret)&&ret.back()==A[j]+x)ret.pop_back();
			if(A[j]+x>2e6)break;
			ret.pb(A[j++]+x);
		}
	}
	swap(A,ret);
}
bool check(const vector<int>&A,int x,int d){
	auto it=upper_bound(A.begin(),A.end(),x);
	if(it!=A.begin()){
		if(*prev(it)+d-1>=x){
			return 1;
		}
	}
	return 0;
}
void dfs2(int u,int ft){
	/*if(u%1000==0){
		D("u=%d sz=%d maxd=%d mx=%d\n",u,SZ(A[u]),maxd,2000000/(1<<maxd));
		if(SZ(A[u])>100000){
			rep(i,0,1000){
				D("%d ",A[u][i]);
			}
			exit(0);
		}
	}*/
	if(dep[u]>maxd){
		push(A[u],a[u],1<<maxd);
	}
	if(dep[u]<=maxd){
		if(check(A[u],b[u],1<<dep[u])){
			ans[u]=1;
		}
	}else{
		if(check(A[u],b[u],1<<maxd)){
			ans[u]=1;
		}
	}
	for(auto&x:e[u])if(x!=ft&&x!=son[u]){
		A[x]=A[u];
		dfs2(x,u);
	}
	if(son[u]){
		A[son[u]]=move(A[u]);
		dfs2(son[u],u);
	}else{
		A[u].clear();
		A[u].shrink_to_fit();
	}
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>n;
	rep(i,2,n){
		int u,v;
		cin>>u>>v;
		e[u].pb(v),e[v].pb(u);
	}
	rep(i,1,n){
		cin>>a[i];
	}
	rep(i,1,n){
		cin>>b[i];
	}
	dfs1(1,0);
	rep(i,1,n)cnt[dep[i]]+=1;
	rep(i,1,n)cnt[i]+=cnt[i-1];
	maxd=1;
	while(maxd<n&&maxd<20&&cnt[maxd+1]<=5000)++maxd;
	// maxd=0; //
	A[1]={0};
	dfs2(1,0);
	rep(i,1,n){
		if(dep[i]<=maxd)a[i]=1<<(dep[i]-1);
		printf("%d%c",a[i],i==n?'\n':' ');
	}
	rep(i,1,n)putchar(ans[i]+48);
	return 0;
}