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
def readln(): return sys.stdin.readline() 
def write(arg): sys.stdout.write(arg)
n = int(input())
f = [[0,[],0,0] for i in range(n+1)]
#i-th node: [Levels, [Child_list], EvenOps, OddOps]
f[1][0] = 1
cnt = 0
picks = []

for i in range(n-1):
    u,v = [int(node) for node in readln().split()]
    if (u > v):
        u += v
        v = u - v
        u -= v
    f[v][0] = f[u][0] + 1
    f[u][1].append(v)
# print(f)
init = [int(x) for x in input().split()]
goal = [int(x) for x in input().split()]
init.insert(0,0)
goal.insert(0,0)

def updateChild(node):
    childStack = f[node][1]
    while (len(childStack) > 0):
        child = childStack.pop()
        f[child][f[node][0] % 2 + 2] += 1
        childStack.extend(f[child][1])

def updateNode(node, level, EvenOps, OddOps):
    if (level % 2 == 0): 
        init[node] = (EvenOps + init[node]) % 2
    else:
        init[node] = (OddOps + init[node]) % 2

stack = [1]
while (len(stack) > 0):
    node = stack.pop(0)
    print('Node visiting:', node)
    stack[0:0] = f[node][1]
    print(stack)
    updateNode(node, f[node][0], f[node][2], f[node][3])
    if (init[node] != goal[node]):
        init[node] = goal[node]
        picks.append(node)
        cnt += 1
        updateChild(node)
        # print(init)
    print(init[1:])
write(str(cnt)+'\n')
for pick in picks: write(str(pick)+'\n')