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).
# Author : -pratyay-
import sys
inp=sys.stdin.buffer.readline
inar=lambda: list(map(int,inp().split()))
inin=lambda: int(inp())
inst=lambda: inp().decode().rstrip('\n\r')
# Am I debugging, check if I'm using same variable name in two places


#dfs (graph,node,parent,child_flipper,grand_child_flipper)
counter=0
init=[]
goal=[]
flip=[]
ans=[]
def dfs(gr,node):
    global init,goal,counter,flip,parent,flip,ans
    if node!=0 or node not in gr[0]:
        
        flip[node]=flip[parent[parent[node]]]
        init[node]^=flip[node]
    if init[node]!=goal[node]:
        init[node]=goal[node]
        flip[node]^=1
        counter+=1
        ans.append(node+1)
    for i in gr[node]:
        if i!=parent[node]:
            parent[i]=node 
            dfs(gr,i)




_T_=1#inin()
for _t_ in range(_T_):
    n=inin()
    counter=0
    graph=[[] for i in range(n)]
    for i in range(n-1):
        u,v=inar()
        graph[u-1].append(v-1)
        graph[v-1].append(u-1)
    flip=[0 for i in range(n)]
    parent=[-1 for i in range(n)]
    init=inar()
    goal=inar()
    dfs(graph,0)
    print(counter)
    for i in ans:
        print(i)
    #print(init)
    #print(goal)


