#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<k ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=k ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i,j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(),_a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
#ifdef tmd
#define TIME(i) Timer i(#i)
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,deque<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define TIME(i)
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif
class Timer {
private:
    string scope_name;
    chrono::high_resolution_clock::time_point start_time;
public:
    Timer (string name) : scope_name(name) {
        start_time = chrono::high_resolution_clock::now();
    }
    ~Timer () {
        auto stop_time = chrono::high_resolution_clock::now();
        auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count();
        double mlength = double(length) * 0.001;
        debug(scope_name, mlength);
    }
};

const ll MOD = 1000000007;
const int iNF = 0x3f3f3f3f;
const ll MAXN = 100005;

int n, k, num[MAXN];
vector<int> edge[MAXN];

bool valid (int nd, int par) {
    bool ret = true;
    for (auto v : edge[nd]) {
        if (v != par) {
            ret &= valid(v, nd);
            if (num[nd] != iNF && num[v] != iNF) {
                ret &= abs(num[v] - num[nd]) == 1;
            }
        }
    }
    return ret;
}

pii wev = {-iNF, iNF};
pii nso = {iNF, -iNF};
pii rng[MAXN];
bool vis[MAXN];
void dfs (int nd, int par) {
    vis[nd] = true;
    if (num[nd] != iNF) {
        rng[nd] = pii(num[nd], num[nd]);
    } else if (nd != par && SZ(edge[nd]) == 1) { // leaf
        rng[nd] = wev;
    } else {
        rng[nd] = wev;
        for (auto v : edge[nd]) {
            if (v != par) {
                dfs(v, nd);
                pii ch = {rng[v].X - 1, rng[v].Y + 1};
                if (rng[v] != wev) {
                    if (rng[nd] == wev) {
                        rng[nd] = ch;
                    } else if (rng[nd].X % 2 != ch.X % 2) {
                        rng[nd] = nso;
                    } else {
                        rng[nd].X = max(rng[nd].X, ch.X);
                        rng[nd].Y = min(rng[nd].Y, ch.Y);
                    }
                }
            }
        }
    }
}

void write (int nd, int par, int cur) {
    if (num[nd] != iNF) {
        return;
    }
    num[nd] = cur;
    for (auto v : edge[nd]) {
        if (v != par) {
            if (cur + 1 >= rng[v].X && cur + 1 <= rng[v].Y) {
                write(v, nd, cur + 1);
            } else if (cur - 1 >= rng[v].X && cur - 1 <= rng[v].Y) {
                write(v, nd, cur - 1);
            }
        }
    }
}
/********** Good Luck :) **********/
int main()
{
    TIME(main);
    IOS();

    cin >> n;
    REP (i, n-1) {
        int u, v;
        cin >> u >> v;
        edge[u].eb(v);
        edge[v].eb(u);
    }
    MEM(num, iNF);
    cin >> k;
    REP (i, k) {
        int v, p;
        cin >> v >> p;
        num[v] = p;
    }

    if (!valid(1, 1)) {
        cout << "No" << endl;
    } else {
        REP1 (i, n) {
            if (!vis[i]) {
                dfs(i, i);

                if (rng[i].X <= rng[i].Y) {
                    write(i, i, rng[i].X);
                }
            }
        }

        bool flag = true;
        REP1 (i, n) {
            flag &= num[i] != iNF;
        }

        cout << (flag ? "Yes" : "No") << endl;
        if (flag) {
            REP1 (i, n) {
                cout << num[i] << endl;
            }
        }
    }
    return 0;
}


Measured memory_bytes: 15488