Iahub is very proud of his recent discovery, propagating trees. Right now, he invented a new tree, called xor-tree. After this new revolutionary discovery, he invented a game for kids which uses xor-trees.

The game is played on a tree having *n* nodes, numbered from 1 to *n*. Each node *i* has an initial value *init*<sub class="lower-index">*i*</sub>, which is either 0 or 1. The root of the tree is node 1.

One can perform several (possibly, zero) operations on the tree during the game. The only available type of operation is to pick a node *x*. Right after someone has picked node *x*, the value of node *x* flips, the values of sons of *x* remain the same, the values of sons of sons of *x* flips, the values of sons of sons of sons of *x* remain the same and so on.

The goal of the game is to get each node *i* to have value *goal*<sub class="lower-index">*i*</sub>, which can also be only 0 or 1. You need to reach the goal of the game by using minimum number of operations.
The first line contains an integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>). Each of the next *n* - 1 lines contains two integers *u*<sub class="lower-index">*i*</sub> and *v*<sub class="lower-index">*i*</sub> (1 ≤ *u*<sub class="lower-index">*i*</sub>, *v*<sub class="lower-index">*i*</sub> ≤ *n*; *u*<sub class="lower-index">*i*</sub> ≠ *v*<sub class="lower-index">*i*</sub>) meaning there is an edge between nodes *u*<sub class="lower-index">*i*</sub> and *v*<sub class="lower-index">*i*</sub>. 

The next line contains *n* integer numbers, the *i*-th of them corresponds to *init*<sub class="lower-index">*i*</sub> (*init*<sub class="lower-index">*i*</sub> is either 0 or 1). The following line also contains *n* integer numbers, the *i*-th number corresponds to *goal*<sub class="lower-index">*i*</sub> (*goal*<sub class="lower-index">*i*</sub> is either 0 or 1).
n = int(input())

tree = {}
parent = {-1:-1}
gp = {}
check = [0] * (n+1)

for i in range(1 , n+1):
	tree[i] = []

for _ in range(n-1):
	a,b = map(int,input().split())
	tree[a] += [b]
	tree[b] += [a]

a = list(map(int,input().split()))
b = list(map(int,input().split()))

count = 0

def solve(root , par):
	parent[root] = par
	for node in tree[root]:
		if node != par:
			solve(node , root)

solve(1 , -1)

def grandparent(root , par):
	gp[root] = parent[parent[root]]
	for node in tree[root]:
		if node != par:
			grandparent(node , root)

grandparent(1 , -1)

def dfs(root , par):
	global count
	if gp[root] != -1:
		if a[root-1] != b[root-1]:
			if check[gp[root]-1] == 0:
				count += 1
				check[root-1] += 1
			elif check[gp[root]-1] % 2:
				check[root-1] = check[gp[root]-1]
			else:
				count += 1
				check[root-1] = check[gp[root]-1] + 1
		else:
			if check[gp[root]-1] % 2:
				count += 1
				check[root-1] = check[gp[root]-1] + 1
			else:
				check[root-1] = check[gp[root]-1]

	for node in tree[root]:
		if node != par:
			dfs(node , root)

dfs(1 , -1)

print(count)
for i in range(len(check)):
	if check[i] == 1:
		print(i+1)