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).
import sys
sys.setrecursionlimit(10**9)

def dfs(node,even,odd,flag):
	# first node is even
	# flag False is even
	# flag True is odd
	if flag:
		init[node] = (init[node]+odd)%2
	else:
		init[node] = (init[node]+even)%2

	if (init[node]!=goal[node]):
		ans.append(node+1)
		init[node] = goal[node]
		for i in graph[node]:
			if flag:
				dfs(i,even,odd+1,not flag)
			else:
				dfs(i,even+1,odd,not flag)
	else:
		for i in graph[node]:
			dfs(i,even,odd,not flag)


nodes = int(input())
graph = [[] for _ in range(nodes)]
for _ in range(nodes-1):
	v,u = input().split()
	v = int(v)
	u = int(u)
	graph[u-1].append(v-1)

init = [int(i) for i in input().split()]
goal = [int(i) for i in input().split()]

ans = []

dfs(0,0,0,False)

s = str(len(ans))+"\n"
for i in ans:
	s += str(i)+"\n"
print(s)