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

__author__ = 'artyom'


def read_int():
  return int(input())


def read_int_ary():
  return map(int, input().split())


n = read_int()

g = [None] * (n + 1)
for i in range(n - 1):
  u, v = read_int_ary()
  if g[u] is None:
    g[u] = []
  g[u].append(v)
  if g[v] is None:
    g[v] = []
  g[v].append(u)

init = [0] + list(read_int_ary())
goal = [0] + list(read_int_ary())
s = []


def solve(graph, level, state, node, parent=-1):
  t = level % 2
  st = list(state)
  if init[node] ^ st[t] == goal[node]:
    s.append(node)
    st[t] = 1 - st[t]
  for child in graph[node]:
    if child != parent:
      solve(graph, level + 1, st, child, node)


solve(g, 0, [1, 1], 1)
print(len(s))
for v in s:
  print(v)