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).
def main():

    for _ in range(n-1):
        u,v = map(int, input().split())
        adj[u].append(v)
        adj[v].append(u)

    for i,j in enumerate(input().split(), start=1):
        val[i] = bool(int(j))

    for i,j in enumerate(input().split(), start=1):
        goal[i] = bool(int(j))

    traversal(
        node = 1, # Empiezo en el root
        level_parity = False, # Empiezo en el nivel 0 (par)
        odd_parity = False, # No he hecho cambios en niveles odd
        even_parity = False # No he hecho cambios en niveles even
    )

    print(len(picks))
    print(*picks, sep="\n")


def traversal(node, level_parity, odd_parity, even_parity):
    """
    1 <= node <= n
    in general, parity is True for odd, False for even
    level_parity: is current level odd or even?
    odd_parity: have we made odd or even changes to odd levels?
    even_parity: have we made odd or even changes to even levels?
    """
    # Visited
    vis[node] = True

    # Have the nodes at my parity (level) changed?
    change_parity = odd_parity if level_parity else even_parity

    # Real value considering parity changes
    real_val = (val[node] != change_parity)
    must_change = (real_val != goal[node])

    if must_change:
        val[node] = not val[node]
        picks.append(node)

    for v in adj[node]:
        if not vis[v]:
            new_odd = odd_parity if not level_parity else (must_change != odd_parity)
            new_even = even_parity if level_parity else (must_change != even_parity)
            traversal(v, not level_parity, new_odd, new_even)



if __name__ == "__main__":
    n = int(input())
    adj = [list() for _ in range((n+1))]     # Lista de adyacentes de cada nodo
    val = [None]*(n+1)   # Lista de valores de cada nodo
    goal = [None]*(n+1)  # Lista de objetivos de cada nodo
    vis = [False]*(n+1)  # Lista de visitado de cada nodo
    picks = []           # Resultados: dónde cambiar el valor
    main()

  	 		 						  					 	  					