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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

template <typename T>
struct Graph {
  int n;
  vector<vector<pair<int, T> > > edge;
  vector<T> dis;
  Graph(){}
  Graph(int n): n(n) {
    edge.resize(n);
    dis.resize(n);
  }
  void dijkstra(int s){
    dijkstra(s, 0);
  }
  T dijkstra(int s, int t){
    // initialize
    fill(dis.begin(), dis.end(), -1);
    vector<bool> used(n, false);
    dis[s] = 0;
    // dijkstra
    priority_queue<pair<T, int>, vector<pair<T, int> >, greater<pair<T, int> > > q;
    q.push(make_pair(0, s));
    while(!q.empty()){
      pair<T, int> p = q.top(); q.pop();
      int at = p.second;
      T distance = p.first;
      if(used[at])continue;
      used[at] = true;
      for(auto itr = edge[at].begin(); itr != edge[at].end(); ++itr){
        int to = (*itr).first;
        T cost = (*itr).second;
        if(used[to])continue;
        if(dis[to] == -1 || dis[to] > distance + cost){
          q.push(make_pair(distance + cost, to));
          dis[to] = distance + cost;
        }
      }
    }
    return dis[t];
  }
  void adde(int at, int to, T cost){
    edge[at].push_back(make_pair(to, cost));
  }
  [[deprecated("This function takes O(|edge[at]|).")]]
  void remove(int at, int to){
    int index = -1;
    for(int i = 0; i < edge[at].size(); i++){
      if(edge[at][i].first == to){
        index = i;
        break;
      }
    }
    edge[at].erase(edge[at].begin() + index);
  }
};

using GraphI = Graph<int>;
using GraphL = Graph<ll>;
using GraphD = Graph<double>;


vector<int> edge[100010], child[100010];
bool used[100010];
int par[100010];
ll p[100010], L[100010], R[100010];
ll cnt[100010];
int r = 0;
GraphL g;

void dfs1(int i){
  used[i] = true;
  for(auto e: edge[i]){
    if(used[e])continue;
    par[e] = i;
    child[i].pb(e);
    dfs1(e);
  }
}

bool ch[100010];

bool dfs2(int i){
  ll lb = 0, rb = g.dis[i];
  for(auto e: child[i]){
    bool b = dfs2(e);
    if(!b)return ch[i] = false;
    lb = max(L[e] - 1, lb);
    if(g.dis[e] > R[e]){
      rb = min(R[e], rb);
    }else{
      rb = min(R[e] - 1, rb);
    }
  }
  if(lb > rb)return ch[i] = false;
  if(p[i] == - inf){
    L[i] = lb, R[i] = rb;
  }else{
    int t = (p[r] + g.dis[i] - p[i]) / 2;
    if(!(lb <= t && t <= rb))return ch[i] = false;
    L[i] = t, R[i] = t;
  }
  return ch[i] = true;
}

void dfs3(int i){
  if(i == r){
    cnt[i] = 0;
  }else{
    if(cnt[par[i]] + 1 == L[i]){
      cnt[i] = L[i];
      p[i] = p[par[i]] - 1;
    }else{
      p[i] = p[par[i]] + 1;
      cnt[i] = cnt[par[i]];
    }
  }
  for(auto e: child[i]){
    dfs3(e);
  }
}

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  g = GraphL(n);
  rep(i, n - 1){
    int a, b; cin >> a >> b, a--, b--;
    edge[a].pb(b);
    edge[b].pb(a);
    g.adde(a, b, 1);
    g.adde(b, a, 1);
  }
  int k; cin >> k;
  fill(p, p + n, - inf);
  rep(i, k){
    int v, vp; cin >> v >> vp, v--;
    p[v] = vp;
    if(i == 0)r = v;
  }
  dfs1(r);
  g.dijkstra(r);
  rep(i, n){
    if(p[i] == - inf)continue;
    ll tmp = (p[r] - p[i]) - (g.dis[r] - g.dis[i]);
    if(tmp % 2 != 0){
      cout << "No" << endl;
      return 0;
    }
  }
  bool b = dfs2(r);
  /*rep(i, n){
    cerr << L[i] << " " << R[i] << endl;
  }*/
  if(!b){
    cout << "No" << endl;
    return 0;
  }
  cout << "Yes" << endl;
  dfs3(r);
  rep(i, n){
    cout << p[i] << endl;
  }
  return 0;
}


Measured memory_bytes: 29696