#include <bits/stdc++.h>

#define PB push_back

using namespace std;

const int N = 5e5 + 500;
const int LOG = 19;

vector < int > t1[N], t2[N];
int n;

int par[LOG][N], dep[N], siz[N];
int u_cnt[N], oduzmi[N], gore[N], dolje[N], tot_u;
int L[N], R[N], tme;

void dfs2(int x, int lst) {
	L[x] = tme++;
	for(int y : t2[x]) {
		if(y == lst) continue;
		dep[y] = dep[x] + 1;
		par[0][y] = x;
		dfs2(y, x);
	}
	R[x] = tme - 1;
}

int lca(int x, int y) {
	if(dep[x] < dep[y]) swap(x, y);
	for(int j = LOG - 1;j >= 0;j--)
		if(dep[x] - dep[y] >= (1 << j)) x = par[j][x];
	if(x == y) return x;
	for(int j = LOG - 1;j >= 0;j--)
		if(par[j][x] != par[j][y])
			x = par[j][x], y = par[j][y];
	return par[0][x];
}

void ddfs2(int x, int lst) {
	siz[x] = 1;
	for(int y : t2[x]) if(y != lst) {
		ddfs2(y, x);
		siz[x] += siz[y];
		u_cnt[x] += u_cnt[y];
		oduzmi[x] += oduzmi[y];
	}
	if(x - 1) {
		dolje[x] = siz[x] - 1 == (u_cnt[x] - oduzmi[x]) / 2;
		gore[x] = (n - siz[x]) - 1 == (tot_u - u_cnt[x] - oduzmi[x]) / 2;
		//printf("x(%d) : dolje (%d) | gore (%d)\n", x, dolje[x], gore[x]);
	}
}

int digni(int x, int k) {
	for(int j = 0;j < LOG;j++)
		if(k & (1 << j)) x = par[j][x];
	return x;
}

int subtree(int x, int y) {
	if(L[x] <= L[y] && R[y] <= R[x])
		return digni(y, dep[y] - dep[x] - 1);
	return par[0][x];
}

int cur, delta[N], ans[N];

void asf(int x, int lst) {
	ans[x] = cur == n - 1;
	for(int y : t2[x]) {
		if(y == lst) continue;
		cur += gore[y] - dolje[y];
		asf(y, x);
		cur -= gore[y] - dolje[y];		
	}
}

int main() {
	scanf("%d", &n);
	for(int i = 1;i < n;i++) {
		int x, y; scanf("%d%d", &x, &y);
		t1[x].PB(y), t1[y].PB(x);
	}
	for(int i = 1;i < n;i++) {
		int x, y; scanf("%d%d", &x, &y);
		t2[x].PB(y), t2[y].PB(x);
	}
	dfs2(1, 1);
	for(int j = 1;j < LOG;j++)
		for(int i = 1;i <= n;i++)
			par[j][i] = par[j - 1][par[j - 1][i]];
	for(int x = 1;x <= n;x++) {
		for(int y : t1[x]) if(x < y) {
			u_cnt[x]++; u_cnt[y]++; tot_u += 2;
			oduzmi[x]++; oduzmi[y]++;
			oduzmi[lca(x, y)] -= 2;
		}
	}
	ddfs2(1, 1);
	
	for(int x = 1;x <= n;x++) {
		map<int,int> kolko;
		for(int y : t1[x]) {
			int yy = subtree(x, y);
			kolko[yy]++;
		}
		for(int y : t2[x]) {
			bool mogu = (int)t1[x].size() - kolko[y] == (int)t2[x].size() - 1;
			//printf("%d -> %d : %d\n", y, x, mogu);
			if(y == par[x][0]) {
				dolje[x] &= mogu;
			} else {
				gore[y] &= mogu;
			}
		}
	} 
	for(int x = 1;x <= n;x++) cur += dolje[x];
	asf(1, 1);
	for(int x = 1;x <= n;x++)
		printf("%d", ans[x] && (t1[x].size() == t2[x].size()));
	printf("\n");
	return 0;
}