//#include <bits/stdc++.h>
 
#include <iostream>
#include <algorithm>
 
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
 
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
 
 
using namespace std;
#define int long long
 
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
 
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
 
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
 
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
 
//debug
#define DEBUG 
 
#define DUMPOUT cout
 
#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...) 
#endif
 
void dump_func() {DUMPOUT << endl;};
 
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}
 
//ostream 
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}
 
template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n, k;
int  l[100000 + 5], r[100000 + 5];
vector<vector<int>> g(100000 + 5);
int ans[100000 + 5];
bool update[100000 + 5];
int oe[100000 + 5];
int root;
int ans1[100000 + 5];

void dfs(int now, int par) {
    if (now != par) {
        l[now] = max(l[now], l[par] - 1);
        r[now] = min(r[now], r[par] + 1);
        if (update[now]) {
            if (ans[now] < l[now] || r[now] < ans[now]) {
                cout << "No" << endl;
                exit(0);
            }
        }
    }
    for (auto nx : g[now]) {
        if (nx == par) continue;
        dfs(nx, now);
        l[now] = max(l[now], l[nx] - 1);
        r[now] = min(r[now], r[nx] + 1); 
        if (update[now]) {
            if (ans[now] < l[now] || r[now] < ans[now]) {
                cout << "No" << endl;
                exit(0);
            }
        }
    }
    return ;
}

void dfs2(int now, int par, int dist) {
    oe[now] = (ans[root] + dist) % 2;
    for (auto nx : g[now]) {
        if (nx == par) continue;
        dfs2(nx, now, dist + 1);
    }
}


signed main() {	
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    rep(i, n - 1) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    cin >> k;
    rep(i, k) {
        int v, p;
        cin >> v >> p;
        v--;
        update[v] = true;
        ans[v] = p;
    }
    rep(i, n) {
        l[i] = -INFLL;
        r[i] = INFLL;
    }
    rep(i, n) {
        if (update[i]) {
            root = i;
            l[i] = ans[i];
            r[i] = ans[i];
        }
    }
    dfs2(root, root, 0);
    rep(i, n) {
        if (update[i]) {
            if (ans[i] % 2 != oe[i]) {
                cout << "No" << endl;
                return 0;
            }
        }
    }
    dfs(root, root);
    dfs(root, root);
    rep(i, n) {
        if (l[i] > r[i] || r[i] % 2 != oe[i]) {
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;
    rep(i, n) {
        if (update[i]) {
            cout << ans[i] << endl;
        }
        else {
            cout << r[i] << endl;
        }
    }

}


Measured memory_bytes: 14336