#include<bits/stdc++.h>
using namespace std;
int n,a[300010],b[300010];
vector<int>G[300010];
char ans[300010];
struct B_{
   int buf[512],stk[2000010],raw[2000010],tp;
   int at(int i){return buf[i];}
   void mdf(int i,int v){stk[++tp]=i,raw[tp]=buf[i],buf[i]=v;}
   void clear(int T){
      for(;tp>T;tp--)buf[stk[tp]]=raw[tp];
   }
}f;
void dfs(int u,int fa,int d){
   int cur=f.tp;
   if(d<=11){
      a[u]=1<<20-d,ans[u]=b[u]&(1<<20-d)-1?'0':'1';
   }else{
      static int g[512];
      for(int i=0;i<512;i++)g[i]=f.at(i);
      for(int i=0;i<512;i++)if(g[i]+a[u]<=2000000&&g[i+a[u]&511]>g[i]+a[u])f.mdf(i+a[u]&511,g[i]+a[u]);
      ans[u]=f.at(b[u]&511)<=b[u]?'1':'0';
   }
   for(int v:G[u])if(v!=fa)dfs(v,u,d+1);
   f.clear(cur);
}
int main(){
   scanf("%d",&n);
   for(int i=1,u,v;i<n;i++){
      scanf("%d%d",&u,&v);
      G[u].push_back(v),G[v].push_back(u);
   }
   for(int i=1;i<=n;i++)scanf("%d",&a[i]);
   for(int i=1;i<=n;i++)scanf("%d",&b[i]);
   for(int i=0;i<512;i++)f.buf[i]=i?(int)1e9:0;
   dfs(1,0,0);
   for(int i=1;i<=n;i++)printf("%d ",a[i]);puts("");
   printf("%s",ans+1);
   return 0;
}