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

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
 
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
 
#define ll long long
#define ull unsigned ll
 
void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}
 
void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

 
namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}
 
  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }
 
  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }
 
  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };
 
  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }
 
  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed
 
  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());
 
  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }
 
  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}


int main(){
  int n;
  //cin >> n;
  reader(&n);

  vector<vector<int>> G(n);
  for(auto i : range(n-1) ){
    int a,b;
    //cin >> a,b;
    reader(&a, &b);

    a--; b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }

  vector<int> w(n, -1);

  int k;
  //cin >> k;
  reader(&k);

  int root = -1;
  for(auto i : range(k) ){
    int v,p;
    //cin >> v,p;
    reader(&v, &p);
    v--;
    w[v] = p;

    root = v;
  }
 
  vector<vector<int>> E(n);
  for(auto i : range(n) ){
    E[i].resize( G[i].size(), 0 );
  }
 
  function<int(int, int)> dfs_01 = [&](int pos, int last){
    int ret = w[pos] != -1;
    for(auto i : range(G[pos].size()) ){
      int nx = G[pos][i];
      if(nx == last) continue;
      int tmp = dfs_01(nx, pos);
      E[pos][i] = tmp;
      ret += tmp;
    }
    return ret;
  };
 
  dfs_01(root, -1);
 
  bool ok = true;
 
  vector<pair<int,int>> values(n, {-1,-1});
 
  function<pair<int,int>(int, int, pair<int,int>)> dfs_2 = [&](int pos, int last, pair<int,int> val) -> pair<int,int>{
    if(w[pos] != -1 && (val.first > w[pos] || val.second < w[pos]) ){
      ok = false;
      return {-1,-1};
    }
    if(w[pos] != -1){
      val = {w[pos], w[pos]};
    }
 
    pair<int,int> nx_val = {val.first-1, val.second+1};
    for(auto i : range(G[pos].size()) ){
      int nx = G[pos][i];
      if(nx == last || E[pos][i] == 0) continue;
      auto res_val = dfs_2(nx, pos, nx_val);
      val.first  = max(val.first, res_val.first);
      val.second = min(val.second, res_val.second);
    }
 
    if(val.first > val.second || (w[pos] != -1 && (val.first > w[pos] || val.second < w[pos])) ){
      ok = false;
      return pair<int,int>{-1, -1};
    }
 
    values[pos] = val;
    return pair<int,int>{val.first-1, val.second+1};
  };
  dfs_2(root, -1, {w[root], w[root]});
 
  function<pair<int,int>(int, int, pair<int,int>)> dfs_3 = [&](int pos, int last, pair<int,int> val) -> pair<int,int>{
    if( values[pos] != pair<int,int>{-1,-1} ){
      val.first  = max(val.first, values[pos].first);
      val.second = min(val.second, values[pos].second);
    }
 
    if(w[pos] != -1 && (val.first > w[pos] || val.second < w[pos]) ){
      ok = false;
      return {-1,-1};
    }
 
    pair<int,int> nx_val = {val.first-1, val.second+1};
    for(auto i : range(G[pos].size()) ){
      int nx = G[pos][i];
      if(nx == last) continue;
      auto res_val = dfs_3(nx, pos, nx_val);
      val.first  = max(val.first, res_val.first);
      val.second = min(val.second, res_val.second);
    }
 
    if(val.first > val.second || (w[pos] != -1 && (val.first > w[pos] || val.second < w[pos])) ){
      ok = false;
      return pair<int,int>{-1, -1};
    }
 
    w[pos] = val.first;
    return pair<int,int>{val.first-1, val.second+1};
  };
  dfs_3(root, -1, values[root]);
 
  for(auto i : range(n) ){
    for(auto j : G[i] ){
      if( abs(w[i]-w[j]) != 1 ){
        ok = false;
        break;
      }
    }
  }
 
  if(!ok){
    puts("No");
    return 0;
  }else{
    puts("Yes");
    for(int i=0; i<n; i++){
      writerLn(w[i]);
    }
  }
 
  return 0;

}


Measured memory_bytes: 25472