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 defaultdict
import sys
sys.setrecursionlimit(10 ** 5)
r = lambda : list(map(int, input().split()))
n = int(input())

arr = defaultdict(list)
parent = dict()

visited = [False] * (n + 1)
p = q = 1
for _ in range(n-1):
    a , b = map(int , input().split())
    arr[a].append(b)
    arr[b].append(a)

x = [0] + r()
y = [0] + r()
c = []

def dfs(i , d):

    if visited[i]: return
    visited[i] = True

    global p
    global q
    global c
    # print('-> ' , p , q )
    if d % 2 == 0:
        if not p:
            x[i] = 1 - x[i]
            p = 1 - p
        
        if x[i] != y[i]:
            # print(i)
            c.append(i)
            # p = 1 - p

    else:
        if not p:
            x[i] = 1 - x[i]
            q = 1 - q
        
        if x[i] != y[i]:
            q = 1 - q
            c.append(i)
            # print(i)

    for node in arr[i]:
        dfs(node , d + 1)

dfs(1 , 0)
print(len(c))
print(*c , sep = '\n')


        
                








