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).
# Author: S Mahesh Raju
# Username: maheshraju2020
# Created on: 24/09/2020 19:25:32

from sys import stdin, stdout, setrecursionlimit
import heapq
from math import gcd, ceil, sqrt
from collections import Counter, deque
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda: list(map(int, stdin.readline().strip().split()))
isa = lambda: stdin.readline().strip().split()
setrecursionlimit(100000)
mod = 1000000007

def getAns(init, goal, d):
    queue = deque([[0, -1, 0, 0, 0]])
    seen = set()
    ans = []
    while len(queue):
        cur, par, xor0, xor1, depth = queue.popleft()
        if cur not in seen:
            seen.add(cur)
            if init[cur] ^ xor0 != goal[cur] and depth == 0:
                ans.append(cur + 1)
                xor0 ^= 1
            if init[cur] ^ xor1 != goal[cur] and depth == 1:
                ans.append(cur + 1)
                xor1 ^= 1
            for neigh in d.get(cur, []):
                queue.append([neigh, cur, xor0, xor1, depth ^ 1])
    return ans

n = ii1()
d = {}
for i in range(n - 1):
    a, b = iia()
    d.setdefault(a - 1, []).append(b - 1)
    d.setdefault(b - 1, []).append(a - 1)
init = iia()
goal = iia()
ans = getAns(init, goal, d)
print(len(ans))
for i in ans:
    print(i)

