#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

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; }
}
constexpr long long mod = 9_ten + 7;

int main(){
  int n;
  cin >> n;

  vector<vector<int>> G(n);
  for(auto i : range(n-1) ){
    int a,b;
    cin >> a,b;
    a--; b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }

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

  int k;
  cin >> k;

  int root = -1;
  for(auto i : range(k) ){
    int v,p;
    cin >> 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){
    println("No");
    return 0;
  }else{
    println("Yes");
    println(join(w, "\n"));
  }

  return 0;
}


Measured memory_bytes: 26372