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(i,odd,even,level):
    global graph, initial,n
    visited=[0 for x in range(n+1)]
    visited[0]=1 
    stack=[]
    stack.append([i,even,odd,level])
    visited[i]=1 
    while(len(stack)):
        a=stack.pop()
        i,even,odd,level=a[0],a[1],a[2],a[3]
        if graph.get(i,0):
            for x in graph[i]:
                if visited[x]==0:
                    if level%2==0:
                        initial[x-1]=(even+initial[x-1])%2
                        stack.append([x,odd,even+1,level+1])
                        visited[x]=1
                    else:
                        initial[x-1]=(odd+initial[x-1])%2
                        stack.append([x,odd+1,even,level+1])
                        visited[x]=1
        else:
            visited[i]=1 
    
n=int(input())
arr=[]
for i in range(n-1):
    u,v=[int(x) for x in input().split()]
    arr.append([u,v])
    
initial=[int(x) for x in input().split()]
target=[int(x) for x in input().split()]

graph={}
for i in range(n-1):
    graph[arr[i][0]]=graph.get(arr[i][0],[])
    graph[arr[i][0]].append(arr[i][1])

cnt,ans=0,[]
for i in range(1,n):
    if initial[i-1]!=target[i-1]:
        dfs(i,0,0,1)
        cnt+=1 
        ans.append(i)
print(cnt)
for i in ans:
    print(i)