#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define elif else if
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int,int>


#define repname(a, b, c, d, e, ...) e
#define rep(...)                    repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define rep0(x)                     for (int rep_counter = 0; rep_counter < (x); ++rep_counter)
#define rep1(i, x)                  for (int i = 0; i < (x); ++i)
#define rep2(i, l, r)               for (int i = (l); i < (r); ++i)
#define rep3(i, l, r, c)            for (int i = (l); i < (r); i += (c))





struct ScalarInput {
    template<class T>
    operator T(){
        T ret;
        cin >> ret;
        return ret;
    }
};
struct VectorInput {
    size_t n;
    VectorInput(size_t n): n(n) {}
    template<class T>
    operator vector<T>(){
        vector<T> ret(n);
        for(T &x : ret) cin >> x;
        return ret;
    }
};
ScalarInput input(){ return ScalarInput(); }
VectorInput input(size_t n){ return VectorInput(n); }

template<typename T>
void print(vector<T> a){
  for(int i=0;i<a.size();i++){
    cout<<a[i]<<" \n"[i+1==a.size()];
  }
}

template<class T>
void print(T x){
    cout << x << '\n';
}
 
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail){
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}


int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n;
  cin>>n;
  vector<vector<int>>edge(n);
  rep(n-1){
    int a,b;
    cin>>a>>b;
    a--;b--;
    edge[a].push_back(b);
    edge[b].push_back(a);
  }
  vector<int>sz(n,1),depth(n,-1),par(n,-1);
  vector<int>todo;
  todo.push_back(0);
  depth[0]=0;
  while(!todo.empty()){
    auto v=todo.back();
    todo.pop_back();
    if(v>=0){
      for(auto u:edge[v]){
        if(depth[u]==-1){
          depth[u]=depth[v]+1;
          par[u]=v;
          todo.push_back(~u);
          todo.push_back(u);
        }
      }
    }
    else{
      v=~v;
      sz[par[v]]+=sz[v];
    }
  }

  vector<int>a(n),b(n);
  rep(i,n)cin>>a[i];
  rep(i,n)cin>>b[i];
  rep(i,n){
    if(depth[i]<=11){
      a[i]=(1<<depth[i]);
    }
  }
  int X=1<<12;
  vector<vector<pair<int,int>>>dp(n);

  auto merge=[&](vector<pair<int,int>>&A,vector<pair<int,int>>&B){
    if(A.size()==0)return B;
    if(B.size()==0)return A;
    int l=min(A[0].first,B[0].first);
    int r=l;
    int idxA=0;
    int idxB=0;

    vector<pair<int,int>>P;
    while(true){
      if(idxA==A.size()&&idxB==B.size())break;
      if(A.size()!=idxA&&((idxB==B.size())||(A[idxA].first<=B[idxB].first))){
        if(A[idxA].first<=r+1){
          r=max(A[idxA].second,r);
        }
        else{
          P.push_back({l,r});
          l=A[idxA].first;
          r=A[idxA].second;
        }
        idxA+=1;
      }
      else{
        assert(idxB!=B.size());
        if(B[idxB].first<=r+1){
          r=max(B[idxB].second,r);
        }
        else{
          P.push_back({l,r});
          l=B[idxB].first;
          r=B[idxB].second;
        }
        idxB+=1;
      }
    }
    P.push_back({l,r});
    return P;
  };


  vector<int>ans(n,0);
  rep(i,n){
    if(depth[i]<11){
      if(b[i]<(1<<(depth[i]+1)))ans[i]=1;
      continue;
    }
    if(depth[i]==11){
      dp[i]={{0,X-1}};
      vector<int>todo;
      todo.push_back(i);
      while(!todo.empty()){
        int v=todo.back();
        for(auto [l,r]:dp[v]){
          if(l<=b[v]&&b[v]<=r)ans[v]=1;
        }
        todo.pop_back();
        vector<int>child;
        for(auto u:edge[v]){
          if(par[u]==v){
            child.push_back(u);
          }
        }
        if(child.size()==2){
          if(sz[child[0]]<sz[child[1]])swap(child[0],child[1]);
        }

        for(auto u:child){
          vector<pair<int,int>>P;
          for(auto [l,r]:dp[v]){
            int l2=min((int)2e6,l+a[u]);
            int r2=min((int)2e6,r+a[u]);
            P.push_back({l2,r2});
          }
          
          dp[u]=merge(dp[v],P);
          todo.push_back(u);
        }
        dp[v].clear();
        dp[v].shrink_to_fit();
      }
    }
  }
  print(a);
  rep(i,n)cout<<ans[i];
  cout<<"\n";
}