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).
# 429A
# Xor-tree
class Node:
    nodes = dict()

    def __init__(self, id):
        self.id = id
        self._value = 0
        self.children = list()
        self.parent = None
        self.action = 0

    def addChild(self, node):
        node.parent = self
        self.children.append(node)

    def inheritOperations(self):
        if self.parent != None:
            if self.parent.parent != None:
                if self.action == 0 and self.parent.parent.action != self.action:
                    self.action = self.parent.parent.action
                    if self.action % 2 == 1:
                        if self.value == 0:
                            self.value = 1
                        else:
                            self.value = 0

    def operate(self):
        if self.value == 0:
            self.value = 1
        else:
            self.value = 0
        self.action = self.action + 1

count = int(input())

for i in range(count):
    Node.nodes[i + 1] = Node(i + 1)

for i in range(count - 1):
    temp = [int(val) for val in input().split()]
    Node.nodes[temp[1]].addChild(Node.nodes[temp[0]])

values = [int(val) for val in input().split()]

for i in range(count):
    Node.nodes[i + 1].value = values[i]

values = [int(val) for val in input().split()]

operations = list()

def checkAndOperate(node):
    node.inheritOperations()
    if node.value != values[node.id - 1]:
        operations.append(node.id)
        node.operate()
    for child in node.children:
        checkAndOperate(child)

checkAndOperate(Node.nodes[1])
print(str(len(operations)))
for operation in operations:
    print(str(operation))
