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 Ai and Bi.
Takahashi wrote integers into K of the vertices. Specifically, for each 1 ≦ j ≦ K, he wrote the integer Pj into vertex Vj. 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:
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.
The input is given from Standard Input in the following format:
N A1 B1 A2 B2 : AN-1 BN-1 K V1 P1 V2 P2 : VK PK
If it is possible to write integers into all empty vertices so that the condition is satisfied, print
Yes. Otherwise, print
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.
5 1 2 3 1 4 3 3 5 2 2 6 5 7
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
5 1 2 3 1 4 3 3 5 3 2 6 4 3 5 7
4 1 2 2 3 3 4 1 1 0
Yes 0 -1 -2 -3
The integers written by Aoki may be negative or exceed 106.