#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#include <time.h>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
typedef vector<ll> vll;
typedef vector< vector<ll> > matrix;
#define REP(i, x, y) for(ll i = (ll)x; i < (ll)y; i++)
#define DREP(i, x, y, d) for(ll i = (ll)x; i < (ll)y; i += (ll)d)
#define PER(i, x, y) for(ll i = (ll)x; i > (ll)y; i--)
#define DPER(i, x, y, d) for(ll i = (ll)x; i > (ll)y; i -= (ll)d)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-12;

struct edge {
    ll to, cost;
};

int V;
vector<edge> G[1000000];
ll d[1000000];

void addedge(int st, int ed, ll co) {
    edge e;
    e.to = ed;
    e.cost = co;
    G[st].push_back(e);
}

vector<ll> par;
void makeRootedTree(vector<ll> &parentVector, ll root) {
    assert(root < (ll)parentVector.size());
    parentVector[root] = -1;
    queue<ll> que;
    que.push(root);
    while (!que.empty()) {
        ll node = que.front();
        que.pop();
        REP (i, 0, G[node].size()) {
            edge e = G[node][i];
            if (e.to != parentVector[node]) {
                parentVector[e.to] = node;
                que.push(e.to);
            }
        }
    }
}

ll dmin[1000000];
ll dmax[1000000];
ll deven[1000000];
bool ok;

void leafToRoot(vector<ll> &parentVector, ll root) {
    queue<ll> que;
    vector<ll> used(V);
    fill(used.begin(), used.end(), 0);
    REP(i, 0, V) {
        if (i != root && G[i].size() == 1) {
            que.push(i);
            used[i] = 1;
        }
    }
    while (!que.empty()) {
        ll node = que.front();
        que.pop();
        if (node == root) {
            break;
        }
        ll parent = parentVector[node];
        used[parent]++;

        //ここに書く
        if (deven[node] != -1) {
            if (deven[node] == deven[parent]) {
                ok = false;
                // cout << "aaa" << endl;
                break;
            }
            if (deven[parent] != -1) {
                if (dmax[parent] < dmin[node] - 1 || dmax[node] + 1 < dmin[parent]) {
                    ok = false;
                    // cout << "bbb" << endl;
                    break;
                }
            }
            deven[parent] = 1 - deven[node];
            dmin[parent] = max(dmin[parent], dmin[node] - 1);
            if ((deven[parent] == 1 && dmin[parent] % 2 == 1) ||
                (deven[parent] == 0 && dmin[parent] % 2 == 0)) {
                dmin[parent]++;
            }
            dmax[parent] = min(dmax[parent], dmax[node] + 1);
            if ((deven[parent] == 1 && dmax[parent] % 2 == 1) ||
                (deven[parent] == 0 && dmax[parent] % 2 == 0)) {
                dmax[parent]--;
            }
            if (dmin[parent] > dmax[parent]) {
                ok = false;
                // cout << "ccc" << endl;
                break;
            }
        }

        if ((parent == root && used[parent] == (ll)G[parent].size()) ||
            (parent != root && used[parent] == (ll)G[parent].size() - 1)) {
            que.push(parent);
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    V = N;
    REP(i, 0, N - 1) {
        ll a, b;
        cin >> a >> b;
        a--;
        b--;
        addedge(a, b, 1);
        addedge(b, a, 1);
    }
    par = vector<ll>(N);
    makeRootedTree(par, 0);
    ok = true;
    ll K;
    cin >> K;
    fill(dmin, dmin + N, -inf);
    fill(dmax, dmax + N, inf);
    fill(deven, deven + N, -1);
    REP(i, 0, K) {
        ll v, p;
        cin >> v >> p;
        v--;
        dmin[v] = p;
        dmax[v] = p;
        if (p & 1) {
            deven[v] = 0;
        } else {
            deven[v] = 1;
        }
    }
    leafToRoot(par, 0);
    if (!ok) {
        cout << "No" << endl;
        return 0;
    } else {
        cout << "Yes" << endl;
        ll ans[N];
        queue<ll> que;
        que.push(0);
        ans[0] = dmin[0];
        if ((deven[0] == 1 && dmin[0] % 2 == 1) ||
            (deven[0] == 0 && dmin[0] % 2 == 0)) {
            ans[0]++;
        }
        while(!que.empty()) {
            ll node = que.front();
            que.pop();
            REP(i, 0, G[node].size()) {
                edge e = G[node][i];
                if (e.to != par[node]) {
                    if (dmin[e.to] <= ans[node] - 1 && ans[node] - 1 <= dmax[e.to]) {
                        ans[e.to] = ans[node] - 1;
                    } else {
                        ans[e.to] = ans[node] + 1;
                    }
                    que.push(e.to);
                }
            }
        }
        REP(i, 0, N) {
            cout << ans[i] << endl;
        }
    }
}


Measured memory_bytes: 43760