#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = m - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}

vector<vector<ll>>g(100005);
vector<ll>val(100005,-1);
vector<ll>t(100005);
bool judgebuf=true;
vector<P>lr(100005);
P dfs(ll k){
  ll l=-INF,r=INF;
  if(val[k]!=-1)l=val[k],r=val[k];
  t[k]=1;
  rep(i,0,g[k].size()){
    if(t[g[k][i]]==0){
      auto p=dfs(g[k][i]);
      if(p.se==INF)continue;
      p.fi--;p.se++;
      if(r==INF){
        l=p.fi,r=p.se;
      }
      else{
        if(abs(l)%2!=abs(p.fi)%2)judgebuf=false;
        chmax(l,p.fi);chmin(r,p.se);
      }
    }
  }
  if(l>r)judgebuf=false;
  //cout<<k spa l spa r<<endl;
  lr[k]=MP(l,r);
  return lr[k];
}

vector<ll>ret(100005);
vector<ll>t2(100005);
void dfs2(ll k, ll x=INF){
  t2[k]=1;
  if(x==INF)ret[k]=lr[k].fi;
  else{
    if(x-1>=lr[k].fi)ret[k]=x-1;
    else ret[k]=x+1;
  }
  rep(i,0,g[k].size()){
    if(t2[g[k][i]]==0)dfs2(g[k][i],ret[k]);
  }
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  //cout<<fixed<<setprecision(10);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  rep(i,0,n-1){
    ll a,b;cin>>a>>b;
    a--;b--;
    g[a].PB(b);
    g[b].PB(a);
  }
  ll k;cin>>k;
  rep(i,0,k){
    ll v,p;cin>>v>>p;
    val[v-1]=p;
  }
  dfs(0);
  if(judgebuf){
    ans1(judge);
    dfs2(0);
    rep(i,0,n)cout<<ret[i]<<endl;
  }
  else ans1(0);
  return 0;
}


Measured memory_bytes: 17408