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).
from collections import *
import bisect
import heapq
 
def ri():
    return int(input())
 
def rl():
    return list(map(int, input().split()))

n = ri()
graph = [[] for i in range(n)]
for _ in range(n - 1):
	u, v = rl()
	u -= 1
	v -= 1
	graph[u].append(v)
	graph[v].append(u)
init = rl()
goal = rl()

nodes_picked = []
if init[0] == goal[0]:
	ans = 0
else:
	ans = 1
	goal = [1  - goal[i] for i in range(n)] 
	nodes_picked.append(0)

visited = [False] * n
visited[0] = True
to_visit = deque()
to_visit.append(0)
while to_visit:
	node = to_visit.popleft()
	for child in graph[node]:
		if not visited[child]:
			if goal[node] - init[node] != goal[child] - init[child]:
				ans += 1
				nodes_picked.append(child)
			to_visit.append(child)
			visited[child] = True
print(ans)
for node in nodes_picked:
	print(node + 1)

 
 