#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;

#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100001

vi adj[N];
pi dp[N];
int ans[N];

void rec(int v, int p){
    pi ret = (ans[v] != INF ? mp(ans[v],ans[v]) : mp(-INF,-INF)); //any
    FORR(i,adj[v]){
        if(i == p) continue;
        if(dp[i].e1 == INF){
            rec(i,v);
        }
        if(dp[i].e1 != -INF){
            if(ret.e1 == -INF){
                ret = {dp[i].e1-1,dp[i].e2+1};
            }
            else{
                pi tmp = {dp[i].e1-1,dp[i].e2+1};
                if(abs(ret.e1)%2 != abs(tmp.e1)%2) REE("No")
                ret.e1 = max(ret.e1,tmp.e1);
                ret.e2 = min(ret.e2,tmp.e2);
                if(ret.e1 > ret.e2) REE("No")
            }
        }
    }
    dp[v] = ret;
    /* whatis(v) */
    /* whatis(dp[v]) */
}

void rec2(int v, int p){
    if(p != -1 && ans[v] == INF){
        if(dp[v].e2 == -INF || ans[p]+1 <= dp[v].e2)
            ans[v] = ans[p]+1;
        else if(ans[p]-1 >= dp[v].e1)
            ans[v] = ans[p]-1;
        else
            assert(0);
        /* ans[v] = ans[p]; */
    }
    if(p == -1){
        ans[v] = dp[v].e1;
        if(ans[v] == -INF)
            ans[v] = 69;
    }
    FORR(i,adj[v]){
        if(i == p) continue;
        rec2(i,v);
    }
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,k;
    sc(n);
    memset(dp,127,n<<3);
    memset(ans,127,n<<2);
    FOR(i,1,n){
        int f,s;
        sc(f,s);
        --f,--s;
        adj[f].pb(s);
        adj[s].pb(f);
    }
    sc(k);
    FOR(i,0,k){
        int w;
        sc(w);
        --w;
        int wh;
        sc(wh);
        /* dp[w] = {wh,wh}; */
        ans[w] = wh;
    }
    rec(0,-1);
    rec2(0,-1);
    cout << "Yes\n";
    FOR(i,0,n)
        cout << ans[i] << '\n';
}



Measured memory_bytes: 17024