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, tag):
        self.tag = tag
        self.parent = None
        self.children = []
        self.operations = 0
        
    def prepare(self):
        if self.grand_parent() != None:
            self.operations = self.grand_parent().operations
        
    def operate(self):
        if self.operations == 0:
            self.operations = 1
        else:
            self.operations = 0
                
    def add_child(self, node):
        self.children.append(node)
    
    def grand_parent(self):
        if self.parent == None:
            return None
        return self.parent.parent
            

def split_input(txt):
    x, y = map(int, txt.split(' '))
    return (x, y)

n = int(input())
raw_nodes = [input() for x in range(1, n)]
raw_nodes = map(split_input, raw_nodes)
        
nodes = {i: MyNode(i) for i in range(1, n + 1)}

root_index = 0;

for current_tag, parent_tag in raw_nodes:
    if root_index == 0:
        root_index = parent_tag
    nodes[current_tag].parent = nodes[parent_tag]
    nodes[parent_tag].add_child(nodes[current_tag])


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

initial_values.insert(0, 0)
goal_values.insert(0, 0)

operations = []

def check_and_do_operation(i):
    node = nodes[i]
    node.prepare()
    if (initial_values[i] != goal_values[i] and node.operations == 0) or (initial_values[i] == goal_values[i] and node.operations == 1):
        operations.append(str(i))
        node.operate()
    for child in node.children:
        check_and_do_operation(child.tag)
check_and_do_operation(root_index)


print(str(len(operations)))
print('\n'.join(operations))
