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).
import sys
sys.setrecursionlimit(2000000)

from collections import defaultdict
import math
import sys 
sys.setrecursionlimit(pow(10,9))
def clc(): 
    n = int(input())
    graph = defaultdict(lambda:[])
    global count ,ans
    count = 0
    ans =[]
    def dfs(node,par,turn):
        global count,ans
        if assign_values[node]!=need_values[node]:
            if not turn:
                count+=1
                ans.append(node)
                turn = turn^1
        else:
            if turn:
                count+=1
                ans.append(node)
                turn = turn^1

        for ele in graph[node]:
            if ele!=par:
                dfs(ele,node,turn)
        
        

    for _ in range(n-1):
        a,b = map(int,input().split())
        graph[a].append(b)
        graph[b].append(a)
    assign_values = [ 0]+list(map(int,input().split()))
    need_values =[0]+list(map(int,input().split()))
    dfs(1,-1,0)
    print(count)
    for ele in ans:
        print(ele)


    



    
    return True
cc = clc()

if not cc :
    print(-1)
   