/**
 *    author:  otera    
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int n;
vector<vector<int>> g;
int k;
vector<int> p;
vector<P> constraints;

pair<int, int> dfs(int v, int par) {
    if(g[v].size() == 1 && g[v][0] == par) {
        if(p[v] == -inf) {
            constraints[v] = {-inf, inf};
            return P{-inf, inf};
        } else {
            constraints[v] = {p[v], p[v]};
            return P{p[v], p[v]};
        }
    }
    int mx = inf, mi = -inf;
    if(p[v] != -inf) {
        mx = p[v], mi = p[v];
    }
    for(auto nv: g[v]) {
        if(nv == par) continue;
        P cst = dfs(nv, v);
        chmin(mx, cst.sc + 1);
        chmax(mi, cst.fr - 1);
    }
    if(mx < mi) {
        cout << "No" << endl;
        exit(0);
    }
    return constraints[v] = {mi, mx};
}

vector<int> ans;

void dfs1(int v, int par, int val) {
    int mx = constraints[v].sc, mi = constraints[v].fr;
    if(val + 1 <= mx && val + 1 >= mi) {
        ans[v] = val + 1;
        for(auto nv: g[v]) {
            if(nv == par) continue;
            dfs1(nv, v, val + 1);
        }
    } else if(val - 1 <= mx && val - 1 >= mi) {
        ans[v] = val - 1;
        for(auto nv: g[v]) {
            if(nv == par) continue;
            dfs1(nv, v, val - 1);
        }
    } else {
        cout << "No" << endl;
        exit(0);
    }
}

void solve() {
	cin >> n;
    g.assign(n, vector<int>());
    rep(i, n - 1) {
        int a, b; cin >> a >> b;
        --a; --b;
        g[a].pb(b);
        g[b].pb(a);
    }
    cin >> k;
    p.assign(n, -inf);
    int v, x;
    rep(i, k) {
        cin >> v >> x;
        --v;
        p[v] = x;
    }
    constraints.resize(n);
    P rcst = dfs(v, -1);
    //vは制約が存在！！
    rep(i, n) {
        //cerr << i << " " << constraints[i].fr << " " << constraints[i].sc << endl;
    }
    ans.assign(n, -inf);
    dfs1(v, -1, p[v] - 1);
    cout << "Yes" << endl;
    rep(i, n) {
        cout << ans[i] << endl;
    }
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}

Measured memory_bytes: 15744