#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000000000000;
constexpr int mod=1000000007;
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int lcm(int a,int b){
    return a/gcd(a,b)*b;
}
bool prime(int a){
    if(a==1)return false;
    for(int i=2;i*i<=a;i++){
        if(a%i==0)return false;
    }
    return true;
}
vector<int>kaijo;
void init_fact(int n){
    kaijo.resize(n+1);
    kaijo[0]=1;
    for(int i=1;i<=n;i++){
        kaijo[i]=kaijo[i-1]*i;
        kaijo[i]%=mod;
    }
}
int modpow(int a,int b){
    if(b==0)return 1;
    if(b%2)return modpow(a,b-1)*a%mod;
    int memo=modpow(a,b/2);
    return memo*memo%mod;
}
int comb(int a,int b){
    //if(!kaijo[0])init_fact(2000010);
    return kaijo[a]*modpow(kaijo[a-b],mod-2)%mod*modpow(kaijo[b],mod-2)%mod;
}
int inv(int x){
    x=modpow(x,mod-2);
    return x;
}
bool kosa(double ax,double ay,double bx,double by,double cx,double cy,double dx,double dy){
    double ta=(cx-dx)*(ay-cy)+(cy-dy)*(cx-ax);
    double tb=(cx-dx)*(by-cy)+(cy-dy)*(cx-bx);
    double tc=(ax-bx)*(cy-ay)+(ay-by)*(ax-cx);
    double td=(ax-bx)*(dy-ay)+(ay-by)*(ax-dx);
    return tc*td<0&&ta*tb<0;
}
int n,k,dist[100010],ans[100010];
bool used[100010];
P range[100010];
vector<int>G[100010];
void dfs(int x){
    used[x]=true;
    for(int i:G[x]){
        if(!used[i]){
            dist[i]=dist[x]+1;
            dfs(i);
            chmax(range[x].fi,range[i].fi-1);
            chmin(range[x].se,range[i].se+1);
        }
    }
}
void dfs1(int x){
    used[x]=true;
    for(int i:G[x]){
        if(!used[i]){
            if(range[i].fi<=ans[x]-1&&ans[x]-1<=range[i].se){
                ans[i]=ans[x]-1;
            }
            else if(range[i].fi<=ans[x]+1&&ans[x]+1<=range[i].se){
                ans[i]=ans[x]+1;
            }
            else{
                puts("No");
                exit(1);
            }
            dfs1(i);
        }
    }
}
signed main(){
    cin>>n;
    rep(i,n-1){
        int a,b;
        cin>>a>>b;
        a--,b--;
        G[a].pb(b);
        G[b].pb(a);
    }
    rep(i,n)range[i]={-INF,INF};
    cin>>k;
    rep(i,k){
        int v,p;
        cin>>v>>p;
        v--;
        range[v]={p,p};
    }
    dfs(0);
    int mod2=-1;
    rep(i,n){
        if(range[i].se-range[i].fi<0){
            puts("No");
            return 0;
        }
        if(range[i].se-range[i].fi==0){
            if(mod2==-1){
                mod2=abs(dist[i]-range[i].fi)%2;
            }
            else{
                if(abs(dist[i]-range[i].fi)%2!=mod2){
                    puts("No");
                    return 0;
                }
            }
        }
    }
    fill(used,used+n,false);
    if(mod2==range[0].fi%2)ans[0]=range[0].fi;
    else ans[0]=range[0].fi+1;
    dfs1(0);
    puts("Yes");
    rep(i,n)cout<<ans[i]<<endl;
    //rep(i,n)cout<<range[i].fi<<" "<<range[i].se<<endl;
    return 0;
}

Measured memory_bytes: 14336