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*<sub class="lower-index">*i*</sub>.

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.
The first line contains single integer *n* (2 ≤ *n* ≤ 10<sup class="upper-index">5</sup>) — 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*<sub class="lower-index">1</sub>, *c*<sub class="lower-index">2</sub>, ..., *c*<sub class="lower-index">*n*</sub> (1 ≤ *c*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>), denoting the colors of the vertices.
none
4
1 2
2 3
3 4
1 2 1 1
YES
2
3
1 2
2 3
1 2 3
YES
2
4
1 2
2 3
3 4
1 2 1 2
NO
3
2 1
2 3
1 2 3
YES
2
4
1 2
2 4
4 3
1 1 3 2
YES
4
2
1 2
1 1
YES
1
10
5 7
4 5
10 2
3 6
1 2
3 4
8 5
4 9
2 3
15 15 15 15 5 15 26 18 15 15
YES
5
8
1 2
1 3
3 5
3 6
1 4
4 7
4 8
1 3 1 1 1 1 1 2
NO
3
2 1
2 3
4 4 4
YES
1
3
1 2
1 3
1 2 2
YES
1
4
1 4
2 4
3 4
1 2 3 1
YES
4
4
1 2
1 3
1 4
1 2 3 4
YES
1
9
1 2
2 3
3 4
4 5
2 7
7 6
2 8
8 9
1 1 2 2 2 3 3 4 4
YES
2
3
2 1
2 3
4 4 5
YES
2
4
1 2
2 3
3 4
1 2 2 1
NO
from collections import defaultdict
def rl():
    return list(map(int,input().split()))
def ri():
    return int(input())
def rm():
    return map(int,input().split())
def solve():
    n=ri()
    g=defaultdict(list)
    for i in range(n-1):
        u,v=rm()
        g[u].append(v); g[v].append(u)
    c=[-1]+rl()
    cs=set()
    cu=defaultdict(list)
    h=-1
    l=set()
    for i in range(1,n+1):
        cs.add(c[i])
        cu[c[i]].append(i)
    if len(cu)==1: return 1
    elif len(cu)==2:
        for u in range(1,n+1):
            t=0
            for v in g[u]:
                if c[v]!=c[u]:t+=1
            if t==1: l.add(u)
            elif t>1 and h==-1: h=u
            elif t!=0: return -1
        if h==-1:
            if len(l)==2: return list(l)[0]
            else: return -1
        for v in g[h]:
            if c[v]!=c[h]: l.discard(v)
        if len(l)!=0: return -1
        else: return h

    for u in range(1,n+1):
        t=set()
        for v in g[u]:
            t.add(c[v])
        t.discard(c[u])
        if len(t)==1: l.add(u)
        elif len(t)==len(cu)-1 and h==-1: h=u
        elif len(t)!=0: return -1
    if h==-1: return -1
    for v in g[h]:
        if c[v]!=c[h]: l.discard(v)
    if len(l)!=0: return -1
    else: return h
a=solve()
if a==-1: print('no')
else:
    print('yes')
    print(a)

    


            


    
        


