Problem:
Score : 800 points

Problem Statement

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 1

5
1 2
3 1
4 3
3 5
2
2 6
5 7

Sample Output 1

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

Sample Input 2

5
1 2
3 1
4 3
3 5
3
2 6
4 3
5 7

Sample Output 2

No

Sample Input 3

4
1 2
2 3
3 4
1
1 0

Sample Output 3

Yes
0
-1
-2
-3

The integers written by Aoki may be negative or exceed 10^6.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
#define RI register int
#define Cannot puts("No"), exit(0);
typedef long long LL;

#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);

using namespace std;

char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {
  if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin);
  return p1 == p2 ? EOF : *(p1++);
}
template <class T> inline void read(T &n) {
  n = 0; RI ch = gc(), f;
  while ((ch < '0' || ch > '9') && ch != '-') ch = gc();
  f = (ch == '-' ? ch = gc(), -1 : 1);
  while (ch >= '0' && ch <= '9') n = n * 10 + (ch ^ 48), ch = gc();
  n *= f;
}

int const MAXN = 1e5 + 5;
struct Edges { int to, next; } e[MAXN * 2];
int head[MAXN], tot;
int l[MAXN], r[MAXN], a[MAXN], vis[MAXN];

inline void addedge(int from, int to) {
  e[++tot] = (Edges){to, head[from]};
  head[from] = tot;
  e[++tot] = (Edges){from, head[to]};
  head[to] = tot;
}

void Put(int now, int fa, int num) {
  vis[now] = 1;
  ++l[now], --r[now];
  if (((l[now] & 1) ^ (num & 1)) && (l[now] < -9e5)) Cannot;
  if (r[now] == num - 1) a[now] = r[now];
  else a[now] = num + 1;
  for (RI i = head[now]; i; i = e[i].next)
    if (e[i].to != fa && !vis[e[i].to])
      Put(e[i].to, now, a[now]);
}

void Dfs(int now, int fa) {
  if (vis[now]) l[now] = r[now] = a[now];
  else l[now] = -1e6, r[now] = 1e6;
  for (RI i = head[now]; i; i = e[i].next)
    if (e[i].to != fa) {
      Dfs(e[i].to, now);
      l[now] = max(l[now], l[e[i].to]);
      r[now] = min(r[now], r[e[i].to]);
    }
  if (l[now] > r[now]) Cannot;
  if (vis[now]) {
    if (l[now] > a[now] || r[now] < a[now]) Cannot;
    if ((a[now] & 1) ^ (l[now] & 1)) Cannot;
    l[now] = r[now] = a[now];
    for (RI i = head[now]; i; i = e[i].next)
      if (e[i].to != fa && !vis[e[i].to])
        Put(e[i].to, now, a[now]);
  }
  --l[now], ++r[now];
}

int main() {
  
#ifdef LOCAL
  FILEIO("a");
#endif

  int n; read(n);
  for (RI i = 1, x, y; i < n; ++i)
    read(x), read(y), addedge(x, y);
  int k; read(k);
  int rt;
  for (RI i = 1, x; i <= k; ++i) {
    read(x), read(a[x]), vis[x] = 1;
    if (i == 1) rt = x;
  }
  Dfs(rt, 0);
  puts("Yes");
  for (RI i = 1; i <= n; ++i)
    printf("%d\n", a[i]);
  
  return 0;
}

// created by Daniel yuan