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).
import sys,io,os
from os import path
if(path.exists('input.txt')):
     sys.stdin = open('input.txt','r')
     sys.stdout = open('output.txt','w')
else:
     input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
visited=[]
graph=[]
goal=0
a=0
kal=0
pop=[]
total=0
def dfs(s):
    global visited,graph,total,goal,a,pop
    stack=[(s,0,0,0)]
    visited[s]=True
    while(len(stack)>0):
        p,t1,t2,r=stack.pop()
        if r==0:
             a[p]^=t1
        else:
             a[p]^=t2
        if goal[p]!=a[p]:
          pop.append(p+1)
          if r==0:
               t1^=1
          else:
               t2^=t1
          total+=1
        r^=1  
        for i in range(len(graph[p])):
            k=graph[p][i]
            if not visited[k]:
                stack.append((k,t1,t2,r))
                visited[k]=True


def main():
     n=int(input())
     global visited,graph,total,goal,a,pop
     visited=[False]*n
     graph=[[] for i in range(n)]
     
     for i in range(n-1):
          a,b=list(map(int,input().split()))
          graph[a-1].append(b-1)
          graph[b-1].append(a-1)

     a=list(map(int,input().split()))
     goal=list(map(int,input().split()))
     dfs(0)
     print(total)
     for i in pop:
          print(i)

for _ in range(1):
    main()
