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).
global flips
flips = 0

a = int(input())
g = [[] for _ in range(a+1)]

for i in range(a-1):
    x, y = map(int, input().split(' '))
    g[x].append(y)
    g[y].append(x)

l1 = [0]+list(map(int, input().split(' ')))
l2 = [0]+list(map(int, input().split(' ')))
visited = [False] * (a+1)
parent = [0] * (a+1)
def dfs(s):
    visited[s] = 1
    for i in g[s]:
        if visited[i] == 0:
            dfs(i)
            parent[i] = s
        
    visited[s] = 2
    
dfs(1)

flip = [False] * (a+1)
visited = [False] * (a+1)

def dfs2(s):
    global flips
    if flip[parent[parent[s]]] == False:
        flip[s] = False
        if l1[s] != l2[s]:
            flip[s] = True
            flips += 1

    else:
        flip[s] = True
        if l1[s] == l2[s]:
            flip[s] = False
            flips += 1
            
    visited[s] = 1
    for i in g[s]:
        if visited[i] == 0:
            dfs2(i)
            
    visited[s] = 2

dfs2(1)

print(flips)
for i in range(len(flip)):
    if flip[i]:
        print(i)
