codeforces 764C Timofey and a tree （思维题）

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 c_i.

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 don't like when many colors 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 ≤ 10⁵) — 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 c₁, c₂, ..., c_n (1 ≤ c_i ≤ 10⁵), 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.

Example

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

题目大意：一个树上有n个节点，n-1条边，每个节点上有一个颜色，现要求选取其中一个节点为根，要求子树的颜色相同，问是否能够达到要求。

题目分析：两个有共同边的节点，如果颜色不一样，那么肯定会有其中一个点选为根，记录这个点的度+1，总的counts+1，最后遍历数组，找出度和counts的大小相同的点并输出。如果没有即是不能达到要求。

#include <cstdio>
#include <cstring>
using namespace std;
int const maxn =  100005;
struct node{
	int u,v;
}a[maxn];
int c[maxn];
int degree[maxn];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<n;i++)
		scanf("%d%d",&a[i].u ,&a[i].v );
	for(int i=1;i<=n;i++) scanf("%d",&c[i]);
	int counts=0;
	memset(degree,0,sizeof(degree));
	for(int i=1;i<n;i++){
		if(c[a[i].u]!=c[a[i].v]){
			counts++;
			degree[a[i].u ]++;
			degree[a[i].v ]++;
		}
	}
	for(int i=1;i<=n;i++){
		if(counts==degree[i]){
			printf("YES\n%d\n",i);
			return 0;
		}
	}
	printf("NO\n");
	return 0;
}