Problem: 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.

Examples

Input

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


Output

Yes
5
6
6
5
7


Input

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


Output

No


Input

4
1 2
2 3
3 4
1
1 0


Output

Yes
0
-1
-2
-3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

const int Maxn = 111111;
struct Edge {
	int v;
	Edge *nxt;
} pool[Maxn*2], *tree[Maxn], *tail = pool;
inline void addedge(const int &u, const int &v) {
	tail->v = v;
	tail->nxt = tree[u], tree[u] = tail++;
}

int n, k, a[Maxn];
bool visited[Maxn];
priority_queue<pair<int, int>> heap;

void solve() {
	for (int u; !heap.empty(); ) {
		u = heap.top().second, heap.pop();
		for (Edge *p = tree[u]; p; p = p->nxt) {
			if (!visited[p->v]) {
				a[p->v] = a[u]-1;
				visited[p->v] = true;
				heap.push({a[p->v], p->v});
			} else {
				if (abs(a[p->v]-a[u]) != 1) {
					puts("No");
					return;
				}
			}
		}
	}
	puts("Yes");
	for (int i = 1; i <= n; ++i) {
		printf("%d\n", a[i]);
	}
}

int main() {
	scanf("%d", &n);
	for (int i = 1, x, y; i < n; ++i) {
		scanf("%d%d", &x, &y);
		addedge(x, y), addedge(y, x);
	}
	scanf("%d", &k);
	for (int x, y; k--; ) {
		scanf("%d%d", &x, &y);
		a[x] = y;
		visited[x] = true;
		heap.push({y, x});
	}
	solve();
	return 0;
}