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())
adj = [[] for i in range(n+1)]

for i in range(n-1):
    x,y = map(int,input().split())
    adj[x].append(y)
    adj[y].append(x)
    
init = list(map(int,input().split()))
goal = list(map(int, input().split()))
    

        
class Solution:
    def __init__(self,n,adj,init,goal):
        self.adj = adj
        self.n = n
        self.visited = [False]*(n+1)
        self.to_be_flipped = [init[i]!=goal[i] for i in range(n)]
        self.flip_counts = 0
        self.flips = []
        
        
        
    def DFS(self, i, flipeven, flipodd):
        
        if self.visited[i]:
            return
        #print(i, flipeven, flipodd, adj[i])
        self.visited[i] = True
        #Decide if a flip is to be performed or not
        
        
        
        if self.to_be_flipped[i-1]==(flipeven%2==0):#flip
            flipeven += 1
            self.flip_counts += 1
            self.flips.append(i)
            
        for child in adj[i]:
            if not self.visited[child]:
                self.DFS(child, flipodd, flipeven)
            
        
    def answer(self):
        self.DFS(1, 0, 0)
        
        print(self.flip_counts)
        for ch in self.flips:
            print(ch)
            
sol = Solution(n,adj,init,goal)
sol.answer()
            
        
        
        
        