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).
n = int(input())

g = dict()
for i in range(n):
    g[i + 1] = set()

for _ in range(n - 1):
    inp = [int(x) for x in input().split()]
    g[inp[1]].add(inp[0])   # directed graph

init = dict()
inp = [int(x) for x in input().split()]
for i in range(n):
    init[i + 1] = inp[i]

goal = dict()
inp = [int(x) for x in input().split()]
for i in range(n):
    goal[i + 1] = inp[i]

def flip(g, v, init, flip):
    if flip:
        init[v] = (init[v] + 1) % 2
        for u in g[v]:
            flip(g, u, init, False)
    else:
        for u in g[v]:
            flip(g, u, init, True)

# bfs
cntr = 0
picks = []
color = dict()
for v in g.keys():
    color[v] = 0
color[1] = 1
if init[1] != goal[1]:
    cntr += 1
    picks.append(1)
    flip(g, 1, init, True)

q = [1]
while q:
    u = q.pop(0)
    for v in g[u]:
        if color[v] == 0:
            color[v] = 1
            q.append(v)
            if init[v] != goal[v]:
                cntr += 1
                picks.append(v)
                flip(g, v, init, True)
    color[u] = 2

print(cntr)
for x in picks:
    print(x)
