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 MyNode:
    
    def __init__(self):
        self.children = []
        self.value = 0
        
    def operate(self):
        if self.value == 0:
            self.value = 1
        else:
            self.value = 0
            
        for child in self.children:
            for grandchild in child.children:
                grandchild.operate()
                
    def add_child(self, node):
        self.children.append(node)
        
nodes = {}

nodes[1] = MyNode()

n = int(input())
for i in range(1, n):
    current_tag, parent_tag = (int(x) for x in input().split(' '))
    current = MyNode()
    nodes[parent_tag].add_child(current)
    nodes[current_tag] = current

initial_values = [int(x) for x in input().split(' ')]
goal_values = [int(x) for x in input().split(' ')]

goal_values.insert(0, 0)

for key in range(1, n + 1):
    nodes[key].value = initial_values[key - 1]

operations = []

def check_and_do_operation(i):
    if nodes[i].value != goal_values[i]:
        operations.append(i)
        nodes[i].operate()

for key in range(1, n + 1):
    check_and_do_operation(key)
    
print(str(len(operations)))
for x in operations:
    print(str(x))
