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).
from typing import List


class Node:
    def __init__(self):
        self.init = 0
        self.goal = 0
        self.children: List[int] = []


def flip(nodes: List[Node], visited: List[bool], node: Node, depth=0):
    if depth % 2 == 0:
        node.init = 1 - node.init
    for child_idx in node.children:
        if visited[child_idx]:
            continue
        visited[child_idx] = True
        flip(nodes, visited, nodes[child_idx], depth + 1)
        visited[child_idx] = False


def solve():
    n = int(input())
    nodes = [Node() for _ in range(n)]
    for _ in range(n-1):
        u, v = map(int, input().split())
        nodes[u-1].children.append(v-1)
        nodes[v-1].children.append(u-1)

    init = list(map(int, input().split()))
    for node, val in zip(nodes, init, strict=True):
        node.init = val

    goal = list(map(int, input().split()))
    for node, val in zip(nodes, goal, strict=True):
        node.goal = val

    visited = [False] * n
    stack = [0]
    visited[0] = True
    count = 0
    flipped: List[int] = []
    while len(stack) > 0:
        node_idx = stack.pop()
        node = nodes[node_idx]
        if node.goal != node.init:
            flipped.append(node_idx)
            count += 1
            flip(nodes, visited, node)

        for child_idx in node.children:
            if visited[child_idx]:
                continue
            stack.append(child_idx)
            visited[child_idx] = True
    print(count)
    for node_idx in flipped:
        print(node_idx + 1)


def main():
    # t = int(input())
    t = 1
    for _ in range(t):
        solve()


if __name__ == "__main__":
    main()
