//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
//#define int long long
using namespace __gnu_pbds;
using namespace std;

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

int n,a[300010],b[300010],dep[300010],d[300010],ok[300010];
vector<int> v[300010];
short dp[150010][510],now[510];

const int B=500;

inline void predfs(int x,int pr)
{
	int cnt=0;
	for(int i=0;i<(int)v[x].size();i++) if(v[x][i]!=pr){
		dep[v[x][i]]=dep[x]+1;cnt++;
	}
	if(cnt<=1){
		for(int i=0;i<(int)v[x].size();i++) if(v[x][i]!=pr){
			d[v[x][i]]=d[x];
		}
	}
	else{
		for(int i=0;i<(int)v[x].size();i++) if(v[x][i]!=pr){
			d[v[x][i]]=d[x]+1;
		}
	}
	for(int i=0;i<(int)v[x].size();i++) if(v[x][i]!=pr){
		predfs(v[x][i],x);
	}
}

inline void dfs(int x,int pr)
{
	ok[x]=0;
	if(dep[x]<=11){
		if(b[x]%B==0&&b[x]/B<=(1<<(dep[x]+1))-1) ok[x]=1;
	}
	else{
		for(int i=0;i<B;i++) now[i]=dp[d[x]][i];
		for(int i=0;i<B;i++){
			int cur=i+(a[x]%B);
			if(cur<B) now[cur]=min(now[cur],(short)(dp[d[x]][i]+a[x]/B));
			else now[cur-B]=min(now[cur-B],(short)(dp[d[x]][i]+a[x]/B+1));
		}
		for(int i=0;i<B;i++) dp[d[x]][i]=now[i];
		if(b[x]/B>=dp[d[x]][b[x]%B]) ok[x]=1;
	}
	for(int i=0;i<(int)v[x].size();i++) if(v[x][i]!=pr){
		if(d[v[x][i]]>d[x]){
			for(int j=0;j<B;j++) dp[d[v[x][i]]][j]=dp[d[x]][j];
		}
		dfs(v[x][i],x);
	}
}

signed main()
{
	ios::sync_with_stdio(false);cin.tie(0);
	cin>>n;
	for(int i=1;i<n;i++){
		int x,y;cin>>x>>y;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) cin>>b[i];
	dep[1]=0;d[1]=0;predfs(1,-1);
	for(int i=1;i<=n;i++) if(dep[i]<=11) a[i]=(1<<dep[i])*B;
	for(int i=1;i<=n;i++) cout<<a[i]<<' ';
	cout<<'\n';
	for(int i=0;i<B;i++) dp[d[1]][i]=10000;
	dp[d[1]][0]=0;
	dfs(1,-1);
	for(int i=1;i<=n;i++) cout<<ok[i];
	cout<<'\n';
	return 0;
}