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^5) — 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_1, c_2, ..., c_{n} (1 ≤ c_{i} ≤ 10^5), 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

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import sys\n\nclass UnionFind:\n    def __init__(self, sz):\n        self.__ranks   = [1] * sz\n        self.__sizes   = [1] * sz\n        self.__parents = [ i for i in range(sz) ]\n\n    def find_parent(self, x):\n        if x == self.__parents[x]:\n            return x\n        else:\n            self.__parents[x] = self.find_parent( self.__parents[x] )\n            return self.__parents[x]\n\n    def same(self, x, y):\n        return self.find_parent(x) == self.find_parent(y)\n\n    def unite(self, x, y):\n        px = self.find_parent(x)\n        py = self.find_parent(y)\n        if px == py:\n            return\n        if self.__ranks[px] > self.__ranks[py]:\n            self.__parents[py] = px\n            self.__sizes[px] += self.__sizes[py]\n        else:\n            self.__parents[px] = py\n            self.__sizes[py] += self.__sizes[px]\n            if self.__ranks[px] == self.__ranks[py]:\n                self.__ranks[py] += 1\n\n    def size(self, n):\n        return self.__sizes[n]\n#### \n\ndef main():\n    n = int(input())\n\n    edge = {}\n    for i in range(n - 1):\n        u,v = list(map(int, sys.stdin.readline().split()))\n        if u not in edge:\n            edge[u] = []\n        if v not in edge:\n            edge[v] = []\n        edge[u].append(v)\n        edge[v].append(u)\n    \n    colors = [-1] * (n + 1)\n    for i,c in enumerate(map(int, sys.stdin.readline().split())):\n        colors[i + 1] = c\n\n    uf = UnionFind(n + 1)\n    for u in list(edge.keys()):\n        for v in edge[u]:\n            if colors[u] == colors[v]:\n                uf.unite(u,v)\n\n    tree = set()\n    for v in range(1,n+1):\n        tree.add(uf.find_parent(v))\n\n    target_v = -1\n    ok = False\n    for u in range(1,n+1):\n        cnt = set()\n        for v in edge[u]:\n            cnt.add(uf.find_parent(v))\n        if len(cnt) == len(tree) - (1 if uf.size(uf.find_parent(u)) == 1 else 0):\n            ok = True\n            target_v = u\n            break\n\n    if ok:\n        print("YES")\n        print(target_v)\n    else:\n        print("NO")\n\ndef __starting_point():\n    main()\n\n\n\n__starting_point()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 18349