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).
#Getting out of comfort zone is the first step of revolution

for test in range(1):
    n = int(input())
    global adj
    adj = list([] for i in range(n+1))
    for i in range(n-1):
        a,b = map(int,input().split())
        adj[a].append(b)
        adj[b].append(a)
    cur = [0] + list(map(int,input().split()))
    tobe = [0] + list(map(int,input().split()))
    ans = 0
    op = []
    def dfs(node,par=-1,par_changes=0,gpar_changes=0):
        if gpar_changes%2:
            cur[node] ^=1

        if cur[node] != tobe[node]:
            cur[node]^=1
            global ans
            ans+=1
            global op
            op.append(node)
            gpar_changes += 1

        for child in adj[node]:
            if child == par:continue
            dfs(child,node,gpar_changes,par_changes)
    
    dfs(1)
    print(ans)
    for i in op:print(i)
            

