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).
class Graph:
    
    def __init__(self, graph=None, size=1):
        if graph is None:
            graph = {}
        self.graph = graph
        self.vis = [0]*(size+5)
        self.ansList = []
    
    def add_vertex(self, vertex):
        if vertex not in self.graph:
            self.graph[vertex] = []
        
    def add_edge(self, a, b):
        self.add_vertex(a)
        self.add_vertex(b)

        self.graph[a].append(b)
        self.graph[b].append(a)
    
    def print_graph(self):
        for key in self.graph:
            print(str(key) + " -> ",end=" ")
            print(self.graph[key])
        
    def dfs(self, node, initial, goal ,even, odd, level):
        self.vis[node] = 1
        if odd and level&1:
             initial[node] = 1-initial[node]
        if even and not level&1:
             initial[node] = 1-initial[node]

        if initial[node]!=goal[node]:
            self.ansList.append(node+1)
            if level&1:
                odd = 1-odd
            else:
                even = 1-even

        for item in self.graph[node]:
            if self.vis[item] == 0:
                self.dfs(item, initial, goal, even, odd, level+1)
        


n= int(input())
graph = Graph(None, n)
for i in range(n-1):
    a,b = map(int,input().split())
    graph.add_edge(a-1,b-1)

initial = list(map(int,input().split()))
goal = list(map(int,input().split()))
graph.dfs(0,initial, goal, 0, 0, 1)
print(len(graph.ansList))
for ans in graph.ansList:
    print(ans)


            