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():
#     def __init__ (self, data, parent):
#         self.data = data
#         self.parent = parent
#     def dfs (self, init, even, odd, level):

n = int(input())
flipped = []
par = [0 for _ in range(n+1)]
child = [[] for _ in range(n+1)]

def flip(num, odd, even, level):
    global flipped
    o, e = 0, 0
    if level % 2 == 0:
        if (init[num] + even) % 2 != goal[num]:
            flipped += [num]
            e += 1

    else:
        if (init[num] + odd) % 2 != goal[num]:
            flipped += [num]
            o += 1
    
    for node in child[num]:
        flip(node, odd + o, even + e, level+1)        

for _ in range(n-1):
    u, v = map(int, input().split())
    if par[u] != 0 or u == 1:
        par[v] = u
        child[u] += [v]
    else:
        par[u] = v
        child[v] += [u]

init = [0]+list(map(int,input().split()))
goal = [0]+list(map(int,input().split()))

flip(1, 0, 0, 0)
m = len(flipped)
print(m)
for e in flipped:
    print(e)