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

FILE=None
#FILE = "./input.txt" 

if FILE:
    sys.stdin = open(FILE, 'r')
    #sys.stdout = open(FILE, 'w')

input = sys.stdin.readline

############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split()))) 
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))

from collections import defaultdict

e = []
for _ in range(int(input())-1):
    e.append(inlt())
cur = inlt()
target = inlt()

g = defaultdict(list)
for edge in e:
    g[edge[0]].append(edge[1])
    g[edge[1]].append(edge[0])

actions = []

#print("e, cur, target: ", e, cur, target)
#print("g: ", g)

def preorder(node, parent, flip_e, flip_o):
    #print("node, parent: ", node, parent)
    if (cur[node-1]!=target[node-1] and flip_e==0) or (cur[node-1]==target[node-1] and flip_e==1):
        actions.append(node) #do a flip 
        cur[node-1] = target[node-1]
        for child in g[node]:
            if child!=parent:
                preorder(child, node, (flip_o+1)%2, flip_e)
    else:
        #print("node: ", node)
        for child in g[node]:
            if child!=parent:
                preorder(child, node, flip_o, flip_e)

preorder(1, -1, 0, 0)
#print("actions: ", actions)
print(len(actions))
for item in actions:
    print(item)













   
