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).
def dfs(u):
    global al, used, parent
    for i in al[u]:
        if not used[i]:
            used[i] = True
            parent[i] = u
            dfs(i)

def fill(i):
    global parent, al, used, init, goal, changed, cnt, res
    if i == 0 or parent[i] == 0:
        changed[i] = 0
    else:
        changed[i] = changed[parent[parent[i]]]
    if changed[i] % 2 == 1:
        cur = 1 - init[i]
    else:
        cur = init[i]
    if cur != goal[i]:
        changed[i] += 1
        changed[i] %= 2
        cnt += 1
        res.append(i)
    for u in al[i]:
        if parent[i] != u:
            fill(u)

n = int(input())
al = [[] for i in range(n)]
for i in range(n - 1):
    a, b = [int(j) - 1 for j in input().split()]
    al[a].append(b)
    al[b].append(a)
used = [False] * n
parent = [-1] * n
used[0] = True
dfs(0)
init = [int(i) for i in input().split()]
goal = [int(i) for i in input().split()]
changed = [0] * n
used = [False] * n
cnt = 0
res = []
fill(0)
print(cnt)
for i in res:
    print(i + 1)