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 operator import xor
pos = []
res = []
n = 0
v = []
ans = []

def BFS():
    global pos, res, v, ans
    mark = [False]*n
    mark[0] = True
    q = []
    if pos[0] == res[0]:
        q.append((0,0,0))
    else:
        q.append((0,0,1))
        ans.append(0)
    while len(q) > 0:
        x = q.pop(0)
        for i in v[x[0]]:
            if mark[i]:
                continue
            mark[i] = True
            if xor(x[1],pos[i])==res[i]:
                q.append((i,x[2],x[1]))
            else:
                q.append((i,x[2],xor(x[1],1)))
                ans.append(i)
n = int(input())
for i in range(n):
    v.append(list([]))
for i in range(1,n):
    s = input()
    s = s.split()
    x = int(s[0])-1
    y = int(s[1])-1
    v[x].append(y)
    v[y].append(x)
s = input()
s = s.split()
for i in s:
    pos.append(int(i))
s = input()
s = s.split()
for i in s:
    res.append(int(i))
BFS()
print(len(ans))
for i in ans:
    print(i+1)