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, deque
from typing import Any, List, Tuple


def solve(
    n: int,
    adj: List[List[int]],
    init: List[int],
    goal: List[int]
) -> List[int]:
    g = defaultdict(list)   # type: Any
    for u, v in adj:
        g[u].append(v)
        g[v].append(u)
    visited = [0] * n
    q = deque([[1, 0, 0, 0]])
    ops = []
    while q:
        curr, height, even_ops, odd_ops = q.popleft()
        visited[curr - 1] = 1
        if curr % 2 == 0:
            if init[curr - 1] ^ [0, 1][even_ops % 2] != goal[curr - 1]:
                even_ops += 1
                ops.append(curr)
        elif curr % 2 == 1:
            if init[curr - 1] ^ [0, 1][odd_ops % 2] != goal[curr - 1]:
                odd_ops += 1
                ops.append(curr)
        for neighbor in g[curr]:
            if not visited[neighbor - 1]:
                q.append([neighbor, height + 1, even_ops, odd_ops])
    return ops

n = int(input())
adj = [list(map(int, input().split())) for _ in range(n-1)]
init = list(map(int, input().split()))
goal = list(map(int, input().split()))

ans = solve(n, adj, init, goal)
print(len(ans))
for x in ans:
    print(x)