Codeforces Round #395(Div. 2)C. Timofey and a tree【思维+并查集缩点+判定】

C. Timofey and a tree

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

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

题目大意：

给你一个N颗点的树，每个节点都有一个颜色。问你能否找出一个点作为根，使得其每颗子树的颜色都是统一的。

思路：

1、如果一部分树可以作为一颗子树，并且其中所有点的颜色都是统一的，那么我们不妨将其划成一个集合，作为一个点来看待，作为一个无向图，我们可以用并查集来完成这个缩点的操作。

2、那么对于一个可行方案来讲，如果假设节点u可以作为这样的根节点，那么很显然，他连出去的子树的深度最多为1.如果为2，那么显然这棵子树颜色就会多于1种 ，那么接下来的任务就是相当于判断整个图的直径是否为2.那么我们缩点之后，总点数为cnt的话，如果一个点的度数为cnt-1，那么这个点就可以作为根节点。

同时很好理解，对于缩点形成的点，肯定缩点之后的边必须要在原图中的某一个点上才行，如果缩点之后的边的集合中有两个点有连出的边，那么这部分肯定不能作为根节点。

3、做好细节处理就没有神马了。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<vector>
using namespace std;
int x[100500];
int y[100500];
int color[100500];
int degree[100500];
int ans[100500];
int f[100500];
vector<int >mp[100500];
int find(int a)
{
    int r=a;
    while(f[r]!=r)
    r=f[r];
    int i=a;
    int j;
    while(i!=r)
    {
        j=f[i];
        f[i]=r;
        i=j;
    }
    return r;
}
int merge(int a,int b)
{
    int A,B;
    A=find(a);
    B=find(b);
    if(A!=B)
    {
        f[B]=A;
    }
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(ans,0,sizeof(ans));
        memset(degree,0,sizeof(degree));
        for(int i=1;i<=n;i++)mp[i].clear();
        for(int i=1;i<=n;i++)f[i]=i;
        for(int i=1;i<=n-1;i++)
        {
            scanf("%d%d",&x[i],&y[i]);
        }
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&color[i]);
        }
        for(int i=1;i<=n-1;i++)
        {
            if(color[x[i]]==color[y[i]])
            {
                merge(x[i],y[i]);
            }
        }
        for(int i=1;i<=n-1;i++)
        {
            int xx=find(x[i]);
            int yy=find(y[i]);
            if(xx==yy)continue;
            degree[xx]++;
            degree[yy]++;
            if(ans[xx]==0)ans[xx]=x[i];
            else if(ans[xx]!=x[i])ans[xx]=-1;
            if(ans[yy]==0)ans[yy]=y[i];
            else if(ans[yy]!=y[i])ans[yy]=-1;
        }
        int cnt=0;
        for(int i=1;i<=n;i++)if(f[i]==i)cnt++;
        if(cnt==1)
        {
            printf("YES\n1\n");
            continue;
        }
        else
        {
            int ok=0;
            for(int i=1;i<=n;i++)
            {
                if(f[i]==i&°ree[i]==cnt-1&&ans[i]!=-1)
                {
                    ok=1;
                    printf("YES\n%d\n",ans[i]);
                    break;
                }
            }
            if(ok==0)printf("NO\n");
        }
    }
}