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 Counter,deque
import string
import bisect
#import random
import math
import sys
sys.setrecursionlimit(10**6) 
from fractions import Fraction
def array_int():
    return [int(i) for i in sys.stdin.readline().split()]
def vary(arrber_of_variables):
    if arrber_of_variables==1:
        return int(sys.stdin.readline())
    if arrber_of_variables>=2:
        return map(int,sys.stdin.readline().split()) 
def makedict(var):
    return dict(Counter(var))
def bfs(node):
    dq=deque()
    dq.append(node)
    visited[node]=1
    level[node]=1
    while len(dq)>0:
        node=dq.popleft()
        visited[node]=1
        for i in tree[node]:
            if visited[i]==0:
                level[i]=level[node]+1
                visited[i]=1
                dq.append(i)
def dfs(node,level,even,odd):
    global ans
    visited[node]=1
    if level[node]%2:
        if (initial[node]+odd)%2==final[node]:
            pass
        else:
            ans+=1
            odd+=1
            pt.append(node)
    else:
        if (initial[node]+even)%2==final[node]:
            pass
        else:
            ans+=1
            even+=1
            pt.append(node)
    for i in tree[node]:
        if visited[i]==0:
            dfs(i,level,even,odd)
    
    
ans=0
testcases=1
for _ in range(testcases):
    n=vary(1)
    tree=[[] for i in range(n+1)]
    
    for _ in range(n-1):
        u,v=vary(2)
        tree[u].append(v)
        tree[v].append(u)
    initial=[44]+array_int()
    final=[55]+array_int()
    visited=[0]*(n+1)
    level=[0]*(n+1)
    bfs(1)
    visited=[0]*(n+1)
    pt=[]
    dfs(1,level,0,0)
    print(ans)
    for i in range(ans):
        print(pt[i])
    

