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.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class XorTree {
	static int mod = 1000000007;

	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[10005]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}

	static List<Integer> adjList[];
	static int init[];
	static int goal[];
	static int ans = 0;
	static boolean visited[];
	static List<Integer> flippers;

	public static void main(String[] args) throws IOException {
		Reader in = new Reader();
		int u, v, i, t, n;
		n = in.nextInt();
		adjList = new List[n + 1];
		for (i = 0; i <= n; i++) {
			adjList[i] = new ArrayList<>();
		}
		for (i = 1; i < n; i++) {
			u = in.nextInt();
			v = in.nextInt();
			adjList[v].add(u);
			adjList[u].add(v);
		}
		init = new int[n + 1];
		goal = new int[n + 1];
		visited = new boolean[n + 1];
		for (i = 1; i <= n; i++)
			init[i] = in.nextInt();
		for (i = 1; i <= n; i++)
			goal[i] = in.nextInt();
//		for (i = 1; i <= n; i++)
//			System.out.println(adjList[i]);
		flippers = new ArrayList<>();
		dfs(1, false, false, 1);
		System.out.println(ans);

		StringBuilder s = new StringBuilder();
		for (i = 0; i < flippers.size(); i++) {
			s.append(flippers.get(i) + "\n");
		}
		System.out.println(s);
	}

	private static void dfs(int curr, boolean oddFlip, boolean evenFlip, int level) {
//		System.out.println(curr + " " + init[curr] + " " + goal[curr] + " o " + oddFlip + " " + evenFlip);
		visited[curr] = true;
		if ((level & 1) == 0 && evenFlip)
			init[curr] = 1 - init[curr];
		else if ((level & 1) == 1 && oddFlip)
			init[curr] = 1 - init[curr];
		if (adjList[curr].size() == 0) {
			if (init[curr] != goal[curr]) {
				ans++;
				flippers.add(curr);
			}
			return;
		}
		boolean flag = false;
		if (init[curr] != goal[curr]) {
//			System.out.println(curr);
			ans++;
			flag = true;
			flippers.add(curr);
		}
		for (int x : adjList[curr]) {
			if (!visited[x]) {
				if ((level & 1) == 0 && flag)
					dfs(x, oddFlip, !evenFlip, level + 1);
				else if ((level & 1) == 1 && flag)
					dfs(x, !oddFlip, evenFlip, level + 1);
				else
					dfs(x, oddFlip, evenFlip, level + 1);
			}
		}
	}
}