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).
class Node:
    def __init__(self, num):
        self.parent = None
        self.children = []
        self.conns = []
        self.init = None
        self.goal = None
        self.num = num

def solve():

    n = int(input())
    nodes = [Node(num+1) for num in range(n)]

    for _ in range(n-1):
        i,j = map(int, input().split())
        nodes[i-1].conns.append(nodes[j-1])
        nodes[j-1].conns.append(nodes[i-1])

    root = nodes[0]
    root.parent = "root"
    set_as_parent(root)


    init = list(map(int, input().split()))
    goal = list(map(int, input().split()))
    for i in range(n):
        nodes[i].init = bool(init[i])
        nodes[i].goal = bool(goal[i])

    rta = best(root)
    print(len(rta))
    for i in rta:
        print(i)


    

def set_as_parent(node):
    for conn in node.conns:
        if conn.parent is None:
            node.children.append(conn)
            conn.parent = node
            set_as_parent(conn)


def best(node):
    rta = []
    if node.init != node.goal:
        rta.append(node.num)
        flip(node)

    for child in node.children:
        rta.extend(best(child))
    
    return rta

def flip(node):
    node.init = not node.init
    for child in node.children:
        flip(child)


solve()
	 		 					  		  	 		     	 	