We have a tree with N vertices. The vertices are numbered 1, 2, ..., N. The i-th (1 ≦ i ≦ N - 1) edge connects the two vertices A_i and B_i.
Takahashi wrote integers into K of the vertices. Specifically, for each 1 ≦ j ≦ K, he wrote the integer P_j into vertex V_j. The remaining vertices are left empty. After that, he got tired and fell asleep.
Then, Aoki appeared. He is trying to surprise Takahashi by writing integers into all empty vertices so that the following condition is satisfied:
 - Condition: For any two vertices directly connected by an edge, the integers written into these vertices differ by exactly 1.
Determine if it is possible to write integers into all empty vertices so that the condition is satisfied. If the answer is positive, find one specific way to satisfy the condition.

-----Constraints-----
 - 1 ≦ N ≦ 10^5
 - 1 ≦ K ≦ N
 - 1 ≦ A_i, B_i ≦ N (1 ≦ i ≦ N - 1)
 - 1 ≦ V_j ≦ N (1 ≦ j ≦ K) (21:18, a mistake in this constraint was corrected)
 - 0 ≦ P_j ≦ 10^5 (1 ≦ j ≦ K)
 - The given graph is a tree.
 - All v_j are distinct.

-----Input-----
The input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_{N-1} B_{N-1}
K
V_1 P_1
V_2 P_2
:
V_K P_K

-----Output-----
If it is possible to write integers into all empty vertices so that the condition is satisfied, print Yes. Otherwise, print No.
If it is possible to satisfy the condition, print N lines in addition. The v-th (1 ≦ v ≦ N) of these N lines should contain the integer that should be written into vertex v. If there are multiple ways to satisfy the condition, any of those is accepted.

-----Sample Input-----
5
1 2
3 1
4 3
3 5
2
2 6
5 7

-----Sample Output-----
Yes
5
6
6
5
7

The figure below shows the tree when Takahashi fell asleep. For each vertex, the integer written beside it represents the index of the vertex, and the integer written into the vertex is the integer written by Takahashi.
Aoki can, for example, satisfy the condition by writing integers into the remaining vertices as follows:
This corresponds to Sample Output 1. Note that other outputs that satisfy the condition will also be accepted, such as:
Yes
7
6
8
7
7

```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 = "class Graph:\n    def __init__(self, n_vertices, edges, directed=True):\n        self.n_vertices = n_vertices\n        self.directed = directed\n        self.edges = edges\n\n    @property\n    def adj(self):\n        try:\n            return self._adj\n        except AttributeError:\n            adj = [[] for _ in range(self.n_vertices)]\n            if self.directed:\n                for u,v in self.edges:\n                    adj[u].append(v)\n            else:\n                for u,v in self.edges:\n                    adj[u].append(v)\n                    adj[v].append(u)\n            self._adj = adj\n            return adj\n\n\ndef solve(tree, vp):\n\n    adj = tree.adj\n    n = tree.n_vertices\n    q = [v-1 for v,p in vp]\n    ranges = [None]*n\n    for v,p in vp:\n        ranges[v-1] = (p,p)\n    \n    while q:\n        nq = []\n        for v in q:\n            a,b = ranges[v]\n            na,nb = a-1,b+1\n            for u in adj[v]:\n                if ranges[u] is None:\n                    ranges[u] = na,nb\n                    nq.append(u)\n                else:\n                    c,d = ranges[u]\n                    if (c+na)%2 == 1:\n                        return None\n                    x,y = max(na,c),min(nb,d)\n                    if x > y:\n                        return None\n                    ranges[u] = (x,y)\n                    if (x,y) != (c,d):\n                        nq.append(u)\n        q = nq\n    return [a for a,b in ranges]\n\n\ndef __starting_point():\n    n = int(input())\n    edges = [tuple(map(lambda x:int(x)-1,input().split())) for _ in range(n-1)]\n    k = int(input())\n    vp = [tuple(map(int,input().split())) for _ in range(k)]\n\n    tree = Graph(n, edges, False)\n\n    res = solve(tree, vp)\n    if res is None:\n        print('No')\n    else:\n        print('Yes')\n        print(*res,sep='\\n')\n__starting_point()"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 16823