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 collections import defaultdict, Counter


def solve(tree, nodes2change):
    nodes2pick = []
    for node in nodes2change:
        nodes2pick.append(node)
        for child in tree[node]:
            for nephew in tree[child]:
                nodes2pick.append(nephew)

    ans = []
    cnt = Counter(nodes2pick)
    for k, v in cnt.items():
        if v % 2 == 1:
            ans.append(k)

    return ans


def main():
    n = int(input())
    graph = defaultdict(list)
    for _ in range(n - 1):
        u, v = map(int, input().split())
        graph[u].append(v)
        graph[v].append(u)

    node = 1
    stack = [1]
    visited = [False] * (n+1)
    visited[1] = True
    tree = defaultdict(list)
    while stack:
        cur = stack.pop()
        for child in graph[cur]:
            if not visited[child]:
                tree[cur].append(child)
                stack.append(child)
                visited[child] = True

    nodes2change = []
    start = [int(c) for c in input().split()]
    end = [int(c) for c in input().split()]
    for i, (s, e) in enumerate(zip(start, end), 1):
        if s != e:
            nodes2change.append(i)

    ans = solve(tree, nodes2change)
    print(len(ans))
    for node in ans:
        print(node)


if __name__ == "__main__":
    main()
