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).
n = int(input())
import sys
def get_ints(): return list(map(int, sys.stdin.readline().strip().split()))
dicts = {}
for i in range(n-1):
    temp = get_ints()
    u = temp[0] - 1 
    v = temp[1] - 1 
    if u not in dicts:
        dicts[u] = []
    dicts[u].append(v)
    if v not in dicts:
        dicts[v] = []
    dicts[v].append(u)
str1 = get_ints()
str2 = get_ints()
lvldicts = {}
lvl = 0 
visited = [0 for _ in range(n)]
def dfs(node, lvl):
    if node is None:
        return 
    if visited[node] == 1 :
        return 
    if lvl not in lvldicts:
        lvldicts[lvl] = []
        
    lvldicts[lvl].append(node)
    visited[node] = 1 
    for elem in dicts[node]:
        dfs(elem, lvl + 1)

def dfsskip(node, flip):
    if node is None:
        return
    if visited[node] == 1 :
        return 
    visited[node] = 1 
    for newelem in dicts[node]:
        if flip == 0:
            dfsskip(newelem, 1)
        else:
            str1[elem] = not str1[elem]
            dfsskip(newelem, 0)
    
    

dfs(0, 0)
ans = 0 
ansarr = []
for key, value in lvldicts.items():
    for elem in value :
        if str1[elem] != str2[elem]:
            ansarr.append(str(elem + 1))
            visited = [0 for _ in range(n)]
            str1[elem] = str2[elem]
            dfsskip(elem, 0)
            ans += 1 
print(ans)
print(" ".join(ansarr))
        
            

    
    
    
    
    
    
    
    
    
    
    
    