#include<bits/stdc++.h>
using namespace std;
constexpr int M=3e5+5,limit=2e6+5;
vector<int>adj[M];
int n,m,num;bool vis[M];
int a[M],b[M],siz[M],son[M],ans[M];
vector<pair<int,int>>vec[30];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
void dfs1(int x,int f){
    siz[x]=1;
    for (auto y:adj[x]){
        if (y==f) continue;
        dfs1(y,x);siz[x]+=siz[y];
        if (siz[y]>siz[son[x]]) son[x]=y;
    }
}
void dfs2(int x,int f){
    if (vis[x]) vec[num]={{0,a[x]*2-1}};
    else{
        vector<pair<int,int>>tmp,tmp1,tmp2;
        swap(tmp1,vec[num]); for (auto [l,r]:tmp1)
            tmp2.emplace_back(min(l+a[x],limit),min(r+a[x],limit));
        tmp.resize(tmp1.size()+tmp2.size());
        merge(tmp1.begin(),tmp1.end(),tmp2.begin(),tmp2.end(),tmp.begin());
        for (auto [l,r]:tmp)
            if (!vec[num].empty()&&vec[num].back().second>=l)
                vec[num].back().second=max(vec[num].back().second,r);
            else vec[num].emplace_back(l,r);
    }
    for (auto [l,r]:vec[num])
        if (l<=b[x]&&b[x]<=r)
            {ans[x]=1;break;}
    for (auto y:adj[x])
        if (y!=son[x]&&y!=f){
            ++num;vec[num]=vec[num-1];
            dfs2(y,x);num--;
        }
    if (son[x]) dfs2(son[x],x);
}
int main(){
    n=read();m=5000;
    for (int i=1;i<n;i++){
        int x=read(),y=read();
        adj[x].emplace_back(y);
        adj[y].emplace_back(x);
    }
    for (int i=1;i<=n;i++) a[i]=read();
    for (int i=1;i<=n;i++) b[i]=read();
    queue<pair<int,int>>q;
    q.emplace(1,0);
    while (!q.empty()&&m--){
        auto [x,d]=q.front();q.pop();
        if (d>20) continue;
        a[x]=1<<d;vis[x]=1;
        for (auto y:adj[x])
            if (!vis[y]) q.emplace(y,d+1);
    } dfs1(1,0);dfs2(1,0);
    for (int i=1;i<=n;i++) printf("%d%c",a[i]," \n"[i==n]);
    for (int i=1;i<=n;i++) putchar(ans[i]?'1':'0');
    return 0;
}