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).
from collections import deque
n=int(input())
h=[[] for i in range(n)]
for i in range(n-1):
    n,m=map(int,input().split())
    h[min(n,m)-1].append(max(n,m)-1)
arr1=list(map(int,input().split()))
arr2=list(map(int,input().split()))
d=dict()
p=deque([[0,0]])
ans=0
p1=[]
while(p):
    a=p.popleft()
    if arr1[a[0]]==arr2[a[0]]:
        if a[1] in d:
            arr1[a[0]]=arr1[a[0]]^1
            ans+=1
            p1.append(a[0])
            t=a[1]+2
            while(t<n):
                if t in d:
                    d.pop(t)
                else:   
                    d[t]=1
                t+=2
        else:
            for i in h[a[0]]:
                p.append([i,a[1]+1])
    else:
        if a[1] in d:
            arr1[a[0]]=arr1[a[0]]^1
            for i in h[a[0]]:
                p.append([i,a[1]+1])
        else:
            ans+=1
            p1.append(a[0])
            t=a[1]+2
            while(t<n):
                if t in d:
                    d.pop(t)
                else:   
                    d[t]=1
                t+=2
print(ans)
for i in p1:
    print(i+1)
            






    
