#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define rep2(i,j,k) for(int i=j;i>=k;i--)
#define DEBUG_VAR(x) { cerr << "* "#x" = " << x << endl; }

using namespace std;
template<typename T> void chkmin(T &x,T y){x=x<y?x:y;}
int read(){
    char ch=getchar();int x=0,f=1;
    for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
    for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';
    return f*x;
}
const int N=3e5,Lim=N/8;
const int LEN = 12;

struct node{
    int nxt,vertice;
}edge[2*N+10];
int head[N+10];int len=0;
void add_edge(int x,int y){
    edge[++len].nxt=head[x];
    edge[len].vertice=y;
    head[x]=len;
    return;
}

int dep[N+10],fa[N+10];

void dfs(int u,int fr){
    dep[u]=dep[fr]+1;
    fa[u]=fr;
    for(int i=head[u];i;i=edge[i].nxt){
        int nop=edge[i].vertice;
        if(nop==fr)continue;
        dfs(nop,u);
    }
    return;
}

bool used[N + 10]; // answer of i has been gotten

int a[N + 10], b[N + 10];

void assign(int i)
{
    assert(dep[i] <= 21);
    int x = (1 << (21 - dep[i]));
    if(a[i] != x) {
        a[i] = x;
    }
}

bool ans[N + 10]; // ans of x

void dfs2(int x)
{
    // DEBUG_VAR(x);
    used[x] = true;
    ans[x] = true;
    for(int i=head[x];i;i=edge[i].nxt){
        int nop=edge[i].vertice;
        if(nop==fa[x])continue;
        dfs2(nop);
    }
}

const int M = 1 << (21 - LEN);
int dp[Lim+5][M];
void Sol(int u,int fr){
    if(used[u])return;
    rep(i,0,M-1)dp[dep[u]][i]=dp[dep[fr]][i];
    int x=(a[u]&(M-1));
    rep(i,0,M-1)chkmin(dp[dep[u]][(i+x)&(M-1)],dp[dep[fr]][i]+a[u]);

    if(dep[u]>LEN){
        int y=(b[u]&(M-1));
        if(dp[dep[u]][y]<=b[u]){
            ans[u]=1; 
        }
    }else{
        ans[u]=(b[u]%a[u]==0);
    }

    for(int i=head[u];i;i=edge[i].nxt){
        int v=edge[i].vertice;
        if(v==fr)continue;
        Sol(v,u);
    }
    return;
}
int main(){
    // freopen("1.in", "r", stdin);
    // freopen("1.out", "w", stdout);
    // DEBUG_VAR(sizeof(dp) / 1024.0 / 1024.0);
    int n=read();
    rep(i,1,n-1){
        int u=read(),v=read();
        add_edge(u,v);
        add_edge(v,u);
    }
    for(int i = 1; i <= n; i++) {
        a[i] = read();
    }
    for(int i = 1; i <= n; i++) {
        b[i] = read();
    }

    dfs(1,0);
    for(int i = 1; i <= n; i++) {
        if(dep[i] <= LEN) {
            assign(i);
        }
    }
    while(true){
        int pos=0;
        rep(i,1,n){
            if(dep[i]>Lim && !used[i]){
                pos=i;
                break;
            }
        }
        if(!pos) break;
        while(dep[pos]>21)pos=fa[pos];
        int pos21 = pos;
        // DEBUG_VAR(pos21);
        rep2(i,21,1){
            assign(pos);
            pos=fa[pos];
        }
        dfs2(pos21);
    }

    rep(i,0,M-1)dp[0][i]=INT_MAX/2;
    dp[0][0]=0;
    Sol(1,0);

    for(int i = 1; i <= n; i++) {
        printf("%d ", a[i]);
    }
    puts("");
    for(int i = 1; i <= n; i++) {
        if(ans[i]) {
            putchar('1');
        } else {
            putchar('0');
        }
    }
    puts("");
    return 0;
}