#include<bits/stdc++.h>
using namespace std;
constexpr int SZ=512;
using BS=bitset<SZ>;
int main()
{
	ios_base::sync_with_stdio(false);
	int n;
	cin>>n;
	vector<vector<int>> G(n+5);
	for(int i=1;i<n;i++)
	{
		int u,v;
		cin>>u>>v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	vector<int> a(n+5),b(n+5),dep(n+5),pa(n+5),maxson(n+5),siz(n+5);
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++)cin>>b[i];
	function<void(int)> dfs1=[&](int u)
	{
		siz[u]=1;
		for(auto v:G[u])
		{
			if(not dep[v])
			{
				pa[v]=u;
				dep[v]=dep[u]+1;
				dfs1(v);
				siz[u]+=siz[v];
				if(siz[v]>siz[maxson[u]])
					maxson[u]=v;
			}
		}
	};
	dep[1]=1;
	dfs1(1);
	int r=20;
	
	//1~12 level 20~9 expo
	for(int i=1;i<=n;i++)
	{
		if(dep[i]<=12)
		{
			a[i]=1<<(21-dep[i]);
		}
	}
	vector<int> ans(n+5);
	function<void(int,vector<int> &)> dfs2=[&](int u,vector<int> &cur)
	{
		if(dep[u]<=12)
		{
			if(b[u]%a[u]==0)
				ans[u]=1;
		}
		else
		{
			vector<int> tmp(SZ,0x3f3f3f3f);
			for(int i=0;i<SZ;i++)
			{
				tmp[i]=min(tmp[i],cur[i]);
				tmp[(i+a[u])%SZ]=min(tmp[(i+a[u])%SZ],cur[i]+a[u]);
			}
			cur.swap(tmp);
			if(cur[b[u]%SZ]<=b[u])
				ans[u]=1;
		}
		for(auto v:G[u])
		{
			if(v==pa[u])continue;
			if(v==maxson[u])continue;
			auto tmp=cur;
			dfs2(v,tmp);
		}
		if(maxson[u])
			dfs2(maxson[u],cur);
	};
	vector<int> cur(SZ,0x3f3f3f3f);
	cur[0]=0;
	dfs2(1,cur);
	for(int i=1;i<=n;i++)
	{
		cout<<a[i]<<" \n"[i==n];
	}
	for(int i=1;i<=n;i++)
	{
		cout<<ans[i];
	}
	return 0;
}