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).
class Node(object):
	def __init__(self,x):
		self.val=0
		self.ind=x
		self.connections=[]
		self.dist=0
		self.flipval=0
		self.parent=None
		self.parentofparent=None
		self.explored=False
def bfs(nodearr,n,final):
	flipped=[]
	visited=[nodearr[0]]
	nodearr[0].parent=Node(100)
	nodearr[0].parentofparent=Node(100)
	# print('#### starting')
	while visited:
		# print(visited[0].ind+1,visited[0].val,visited[0].dist,visited[0].flipval,visited[0].parent.ind+1,visited[0].parentofparent.ind+1)
		if (visited[0].val+visited[0].flipval)%2!=final[visited[0].ind]:
			visited[0].flipval+=1
			flipped.append(visited[0].ind+1)
			# print('flipval changed', flipped)
		for c in visited[0].connections:
			if(c.explored==False):
				visited.append(c)
				c.parent=visited[0]
				c.parentofparent=visited[0].parent
				if c.parentofparent.ind!=100:
					c.flipval=c.parentofparent.flipval
				c.dist=visited[0].dist+1
		visited[0].explored=True
		visited=visited[1:]
	return flipped




n=int(input())
nodearr=[]
for i in range(n):
	nodearr.append(Node(i))
for i in range(n-1):
	x,y=map(int,input().split())
	nodearr[y-1].connections.append(nodearr[x-1])
	nodearr[x-1].connections.append(nodearr[y-1])
values=list(map(int,input().split()))
final=list(map(int,input().split()))
for i in range(n):
	nodearr[i].val=values[i]
flipped=bfs(nodearr,n,final)
print(len(flipped))
for x in flipped:
	print(x)
