Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.

Now it's time for Timofey birthday, and his mother asked him to remove the tree. Timofey removes the tree in the following way: he takes some vertex in hands, while all the other vertices move down so that the tree becomes rooted at the chosen vertex. After that Timofey brings the tree to a trash can.

Timofey doesn't like it when many colors are mixing together. A subtree annoys him if there are vertices of different color in it. Timofey wants to find a vertex which he should take in hands so that there are no subtrees that annoy him. He doesn't consider the whole tree as a subtree since he can't see the color of the root vertex.

A subtree of some vertex is a subgraph containing that vertex and all its descendants.

Your task is to determine if there is a vertex, taking which in hands Timofey wouldn't be annoyed.

Input

The first line contains single integer n (2 ≤ n ≤ 105) — the number of vertices in the tree.

Each of the next n - 1 lines contains two integers u and v (1 ≤ u, v ≤ n, u ≠ v), denoting there is an edge between vertices u and v. It is guaranteed that the given graph is a tree.

The next line contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 105), denoting the colors of the vertices.

Output

Print "NO" in a single line, if Timofey can't take the tree in such a way that it doesn't annoy him.

Otherwise print "YES" in the first line. In the second line print the index of the vertex which Timofey should take in hands. If there are multiple answers, print any of them.

Examples

Input

4
1 2
2 3
3 4
1 2 1 1


Output

YES
2

Input

3
1 2
2 3
1 2 3


Output

YES
2

Input

4
1 2
2 3
3 4
1 2 1 2


Output

NO
import java.io.*;
import java.util.*;

public class Solution {

//	public static final double EPS = 1e-9;
//	public static final int MOD = 1000000009;
//	public static final double PI = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679;
//	public static final int DX[] = {1, -1, 0, 0};
//	public static final int DY[] = {0, 0, 1, -1};
//	public static final int sievesize = (int) (1e6);
//	public static boolean[] prime;

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		Task solver = new Task();
		solver.solve(1, in, out);
		out.close();
	}

	static class Task {
		
		public void solve(int testNumber, InputReader in, OutputWriter out) throws IOException {
			int n = in.nextInt();
			int[] u = new int[n - 1], v = new int[n - 1];
			for (int i = 0; i < n - 1; i++) {
				u[i] = in.nextInt() - 1;
				v[i] = in.nextInt() - 1;
			}
			int[] c = in.nextIntArray(n);
			int[] d = new int[n];
			int e = 0;
			for (int i = 0; i < n - 1; i++) {
				if (c[u[i]] != c[v[i]]) {
					e++;
					d[u[i]]++;
					d[v[i]]++;
				}
			}
			for (int i = 0; i < n; i++) {
				if (d[i] == e) {
					out.println("YES", i + 1, "\n");
					return;
				}
			}
			out.println("NO", "\n");
 		}

//		static class Node {
//			String name;
//			LinkedList<Node> list;
//			
//			public Node(String name) {
//				this.name = name;
//				list = new LinkedList<>();
//			}
//		}
        
//		static class Pair<T1, T2> {   	
//	      	T1 first;
//	      	T2 second;
//		        	
//		    public Pair(T1 first, T2 second) {
//	    		this.first = first;
//				this.second = second;
//			}
//	    }
		
//		public void sieve() {
//			prime = new boolean[sievesize + 1];
//			Arrays.fill(prime, true);
//		    for(int x = 2; x * x < sievesize; x++) { 
//		    	if(prime[x])
//		    		for(int y = x * 2; y < sievesize; y += x) 
//		    			prime[y] = false; 
//		    }
//		} 

//		public int[] shuffle(int arr[], Random gen) {
//			for (int i = arr.length - 1; i > 0; i--) {
//	            int index = gen.nextInt(i + 1);
//	            int temp = arr[index];
//	            arr[index] = arr[i];
//	            arr[i] = temp;
//			}
//			return arr;
//		}
	
//		public boolean triangle(long a, long b, long c) {
//		    return ((a+b) > c && (b+c) >a && (a+c) > b);
//		}
	
//		public boolean isPerfectSquare(long n) {
//			if (n < 0) return false;
//		    long test = (long) (Math.sqrt(n) + 0.5);
//		    return test*test == n;
//		}
	
//		public int isnum(char s) {
//			if(s=='1' || s=='2' || s=='3' || s=='4' || s=='5' || s=='6' || s=='7' || s=='8' || s=='9' || s=='0')  return 1; 
//			return 0;
//		}
	
//		public long nextPowerOf2(long n) {
//		    n--;
//		    n |= n >> 1;
//		    n |= n >> 2;
//		    n |= n >> 4;
//		    n |= n >> 8;
//		    n |= n >> 16;
//		    n++;
//		    return n;
//		}
	
//		public  int gcd(int a, int b) {
//		    int t; 
//		    while (b > 0){ 
//		    	a = a % b; 
//		    	t = a; 
//		    	a = b; 
//		    	b = t; 
//		    }
//		    return a;
//		}
	
//		public static int findGcdArray(int[] arr) {
//			int min = Integer.MAX_VALUE;
//			for (int i = 0; i < arr.length; i++)
//				min = Math.min(min, arr[i]);
//			while (min > 1) {
//				int i = 0, s = 0;
//				while (i < arr.length) {
//					s += arr[i] % min;
//					i++;
//				}
//				if (s == 0) return min;
//				min--;
//			}
//			return 1;
//		}
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}
		
		private void tokenize() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
		}

		public String next() {
			tokenize();
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}
		
		public char nextChar() {
			return next().charAt(0);
		}
		
		public float nextFloat() {
			return Float.parseFloat(next());
		}
		
		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int size) {
			tokenize();
			int[] arr=new int[size];
			for(int i = 0; i < size; i++) {
				tokenize();
				arr[i] = Integer.parseInt(tokenizer.nextToken());
			}
			return arr;
		}
		
		public long[] nextLongArray(int size) {
			tokenize();
			long[] arr=new long[size];
			for(int i = 0; i < size; i++) {
				tokenize();
				arr[i] = Long.parseLong(tokenizer.nextToken());
			}
			return arr;
		}
		
		public float[] nextFloatArray(int size) {
			tokenize();
			float[] arr=new float[size];
			for(int i = 0; i < size; i++) {
				tokenize();
				arr[i] = Float.parseFloat(tokenizer.nextToken());
			}
			return arr;
		}

		public double[] nextDoubleArray(int size) {
			tokenize();
			double[] arr=new double[size];
			for(int i = 0; i < size; i++) {
				tokenize();
				arr[i] = Double.parseDouble(tokenizer.nextToken());
			}
			return arr;
		}

		public String[] nextStringArray(int size) throws IOException {
			String[] arr=new String[size];
			for(int i = 0; i < size; i++) 
				arr[i] = reader.readLine();
			return arr;
		}

		public char[] nextCharArray(int size) throws IOException {
			return reader.readLine().toCharArray();
		}
	}

	static class OutputWriter {
		public PrintWriter pw;

		public OutputWriter(OutputStream stream) {
			pw = new PrintWriter(stream);
		}
		
		public void println(Object... obj) {
			if (obj.length == 0) pw.println();
			else {
				String delimiter = (String) obj[obj.length - 1];
				for (int i = 0 ; i < obj.length - 2; i++) {
					pw.print(obj[i]);
					pw.print(delimiter);
				}
				pw.println(obj[obj.length - 2]);
			}
		}

		public void close() {
			pw.close();
		}

		public void flush() {
			pw.flush();
		}

		public void printStringArray(String[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.println(arr[i]);
		}

		public void printIntArray(int[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printLongArray(long[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printCharArray(char[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printFloatArray(float[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printDoubleArray(double[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
		
		public void printIntArrayList(ArrayList<Integer> arr) {
			for (int i = 0; i < arr.size(); i++)
				pw.print(arr.get(i) + " ");
		}
	}
}