// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int N, K, rt;
vector<int> G[MAXN];
int val[MAXN];

void input()
{
    read(N);
    for (int i = 1; i < N; ++i) {
        int u, v;
        read(u); read(v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    read(K);
    std::fill(val + 1, val + N + 1, -1);
    for (int i = 1; i <= K; ++i) {
        int u, x;
        read(u); read(x);
        val[u] = x;
        rt = u;
    }
}

int req[MAXN], minreq[MAXN];
int fadd[MAXN];

void dfs1(int u, int f, int cur)
{
    cur += fadd[u];
    if (~val[u]) {
        if (val[u] > cur || ((cur - val[u]) & 1)) {
            puts("No");
            exit(0);
        }
        req[u] = (cur - val[u]) / 2;
    } else
        req[u] = +oo;
    minreq[u] = req[u];
    for (int i = 0; i < SZ(G[u]); ++i) {
        int v = G[u][i];
        if (v == f)
            continue;
        dfs1(v, u, cur);
        chkmin(minreq[u], minreq[v]);
    }
}

void dfs2(int u, int f, int x)
{
    if (u != rt) {
        if (minreq[u] > x) {
            fadd[u] = -1;
            ++x;
        }
        if (req[u] != +oo && req[u] != x) {
            puts("No");
            exit(0);
        }
        val[u] = val[f] + fadd[u];
    }
    for (int i = 0; i < SZ(G[u]); ++i) {
        int v = G[u][i];
        if (v == f)
            continue;
        dfs2(v, u, x);
    }
}

void solve()
{
    std::fill(fadd + 1, fadd + N + 1, +1);
    fadd[rt] = 0;
    dfs1(rt, 0, val[rt]);
    dfs2(rt, 0, 0);

    puts("Yes");
    for (int i = 1; i <= N; ++i) {
        printf("%d\n", val[i]);
    }
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();
}

// 章台柳，章台柳，昔日青青今在否？
//     -- 韩翃《章台柳·寄柳氏》


Measured memory_bytes: 15744