#line 1 "C.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/home/sigma/comp/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
#line 5 "C.cpp"

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int N; cin >> N;
	VV<int> G(N);
	rep(i,N-1){
		int x,y; cin >> x >> y; x--,y--;
		G[x].pb(y); G[y].pb(x);
	}
	V<int> A(N); rep(i,N) cin >> A[i];
	V<int> B(N); rep(i,N) cin >> B[i];

	V<int> sz(N);
	V<int> depth(N);
	VV<int> cs(N);
	{
		auto dfs = [&](auto&& self, int v, int p) -> void {
			sz[v] = 1;
			for(int u: G[v]) if(u != p){
				cs[v].eb(u);
				depth[u] = depth[v] + 1;
				self(self,u,v);
				sz[v] += sz[u];
			}
		};
		dfs(dfs,0,-1);
	}

	V<bool> ans(N);
	const int inf = 1e8;
	auto dfs2 = [&](auto&& self, int v, V<int>& dp) -> void {
		{
			V<int> nx = dp;
			rep(i,512) chmin(nx[(i+A[v])%512],dp[i]+A[v]);
			dp = nx;
		}
		ans[v] = dp[B[v]%512] <= B[v];
		if(si(cs[v]) == 1){
			self(self,cs[v][0],dp);
		}
		if(si(cs[v]) == 2){
			int a = cs[v][0], b = cs[v][1];
			if(sz[a] < sz[b]) swap(a,b);
			{
				// light b, log 段しか再帰でここを通らない
				V<int> ep = dp;
				self(self,b,ep);
			}
			self(self,a,dp);
		}
	};
	auto dfs = [&](auto&& self, int v) -> void {
		if(depth[v] <= 11){
			A[v] = 1 << (20-depth[v]);
			ans[v] = B[v]%A[v] == 0;
			for(int u: cs[v]) self(self,u);
		}else{
			V<int> dp(512,inf); dp[0] = 0;
			dfs2(dfs2,v,dp);
		}
	};
	dfs(dfs,0);
	rep(i,N) cout << A[i] << " ";
	cout << endl;
	rep(i,N) cout << (ans[i]?'1':'0');
	cout << endl;
}