#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;using pii=pair<int,int>;
const int N=3e5+5,M=N*100+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=5e18+7;mt19937 rnd(time(0));
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n;
int k=12,lim=2e6;
vector<int> S[N];
int siz[N],son[N],d[N],fa[N];
void make(int x,int La){
	siz[x]=1;fa[x]=La;d[x]=d[La]+1;
	for(int i:S[x]) if(i^La) make(i,x),siz[x]+=siz[i],siz[i]>siz[son[x]]&&(son[x]=i);
}
int A[N],B[N],ans[N];
void work(vector<pii> &f,int k){
	int len=f.size();
	vector<pii> A=f;
	for(int i=0;i<len;i++) A[i]=f[i];
	for(int i=0;i<len;i++) if(f[i].fi+k<=lim) A.emplace_back(f[i].fi+k,min(lim,f[i].se+k));
	inplace_merge(A.begin(),A.begin()+len,A.end());
	f.clear();
	for(auto i:A){
		if(f.empty()||f.back().se<i.fi-1) f.push_back(i);
		else f.back().se=max(f.back().se,i.se);
	}
}
int cts=0;
void dfs(int x,int La,vector<pii> &f){
	work(f,A[x]);
	for(auto i:f) if(i.fi<=B[x]&&B[x]<=i.se) ans[x]=1;
	for(int i:S[x]) if(i^La&&i^son[x]){
		vector<pii> g=f;
		dfs(i,x,g);
		g.clear();g.shrink_to_fit();
	}
	if(son[x]) dfs(son[x],x,f);
}
void Solve(){
	scanf("%d",&n);
	for(int i=1;i<n;i++){
		int x,y;scanf("%d%d",&x,&y);
		S[x].push_back(y);S[y].push_back(x);
	}
	for(int i=1;i<=n;i++) scanf("%d",&A[i]);
	for(int i=1;i<=n;i++) scanf("%d",&B[i]);
	make(1,0);
	for(int i=1;i<=n;i++) if(d[i]<=k) A[i]=(1<<d[i]-1);
	vector<pii> f;f.emplace_back(0,0);
	dfs(1,0,f);
	for(int i=1;i<=n;i++) printf("%d%c",A[i]," \n"[i==n]);
	for(int i=1;i<=n;i++) printf("%d",ans[i]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}