Problem: 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 initi, 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 goali, which can also be only 0 or 1. You need to reach the goal of the game by using minimum number of operations.

Input

The first line contains an integer n (1 ≤ n ≤ 105). Each of the next n - 1 lines contains two integers ui and vi (1 ≤ ui, vi ≤ n; ui ≠ vi) meaning there is an edge between nodes ui and vi. 

The next line contains n integer numbers, the i-th of them corresponds to initi (initi is either 0 or 1). The following line also contains n integer numbers, the i-th number corresponds to goali (goali is either 0 or 1).

Output

In the first line output an integer number cnt, representing the minimal number of operations you perform. Each of the next cnt lines should contain an integer xi, representing that you pick a node xi.

Examples

Input

10
2 1
3 1
4 2
5 1
6 2
7 5
8 6
9 8
10 5
1 0 1 1 0 1 0 1 0 1
1 0 1 0 0 1 1 1 0 1


Output

2
4
7

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class dsu {

	static ArrayList<Integer>[] adj;
	static int[] me;
	static int[] goal;
	static int[] done;
	static boolean[] visited;
	static int count = 0;
	static HashSet<Integer> h=new HashSet<>();
	public static void dfs(int u, int state, HashSet<Integer> num) {
		visited[u] = true;

		if (goal[u] != me[u] && num.contains(state%2)) {

		} else if (goal[u] == me[u] && !num.contains(state%2)) {

		} else {
			count++;
			done[u] = 1;
			if(goal[u] != me[u]) {
				num.add(state%2);
			}
			else
				num.remove(state%2);
		}
		for (int v : adj[u]) {
			if (!visited[v]) {
				
				dfs(v, state + 1, (HashSet<Integer>)num.clone());
			}
		}
	}

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		adj = new ArrayList[n + 1];
		for (int i = 0; i < adj.length; i++) {
			adj[i] = new ArrayList<>();
		}
		me = new int[n + 1];
		goal = new int[n + 1];
		done = new int[n + 1];
		visited = new boolean[n + 1];

		for (int i = 0; i < n - 1; i++) {
			st = new StringTokenizer(br.readLine());
			int u = Integer.parseInt(st.nextToken());
			int v = Integer.parseInt(st.nextToken());
			adj[u].add(v);
			adj[v].add(u);
		}
		st = new StringTokenizer(br.readLine());
		for (int i = 1; i < me.length; i++) {
			me[i] = Integer.parseInt(st.nextToken());
		}
		st=new StringTokenizer(br.readLine());
		for (int i = 1; i < me.length; i++) {
			goal[i] = Integer.parseInt(st.nextToken());
		}
		dfs(1, 0, new HashSet<>());
		System.out.println(count);
		for (int i = 1; i < done.length; i++) {
			if (done[i] == 1)
				System.out.println(i);
		}
		pw.flush();
	}

	static int gcd(int a, int b) {
		if (b == 0)
			return a;
		return gcd(b, a % b);
	}

	static class pair implements Comparable<pair> {
		int x;
		int y;

		pair(int r, int t) {
			x = r;
			y = t;
		}

		public String toString() {
			return "(" + x + "," + y + ")";
		}

		@Override
		public int compareTo(pair o) {
			// TODO Auto-generated method stub
			return o.x - x;
		}

	}

	static long power(long x, long y, int p) {

		// Initialize result
		long res = 1;

		// Update x if it is more than or
		// equal to p
		x = x % p;

		while (y > 0) {

			// If y is odd, multiply x
			// with result
			if (y % 2 == 1)
				res = (res * x) % p;

			// y must be even now
			y = y >> 1; // y = y/2
			x = (x * x) % p;
		}

		return res;
	}

	// Returns n^(-1) mod p
	static long modInverse(long n, int p) {
		return power(n, p - 2, p);
	}

	// Returns nCr % p using Fermat's
	// little theorem.
	static long nCrModPFermat(int n, int r, int p) {

		// Base case
		if (r == 0)
			return 1;

		// Fill factorial array so that we
		// can find all factorial of r, n
		// and n-r
		long[] fac = new long[n + 1];
		fac[0] = 1;

		for (int i = 1; i <= n; i++)
			fac[i] = (fac[i - 1] * i) % p;

		return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p;
	}

}