#include <bits/stdc++.h>

#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
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; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 };
int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

const int N = 100000;
vii G(N);
vector<pii> value(N, pii(-inf, inf));
vector<int> depth(N);

bool even;

void depth_dfs(int now, int par, int d) {
  depth[now] = d;
  rep (i, G[now].size()) {
    if (G[now][i] == par) continue;
    depth_dfs(G[now][i], now, d + 1);
  }
}

pii merge(pii a, pii b) {
  pii res(max(a.first, b.first), min(a.second, b.second));
  if (res.first >= res.second) {
    return pii(-1, -1);
  }
  else return res;
}

pii dfs(int now, int par) {
  pii range = value[now];
  rep (i, G[now].size()) {
    if (G[now][i] == par) continue;
    pii temp = dfs(G[now][i], now);
    temp.first--; temp.second++;
    if (even == (depth[now] % 2 == 0)) {
      if (temp.first % 2 != 0) temp.first++;
      if (temp.second % 2 == 0) temp.second--;
    }
    else {
      if (temp.first % 2 == 0) temp.first++;
      if (temp.second % 2 != 0) temp.second--;
    }
    
    range = merge(range, temp);
    if (range.first >= range.second) {
      cout << "No" << endl;
      exit(0);
    }
  }
  if (even == (depth[now] % 2 == 0)) {
    if (range.first % 2 != 0) range.first++;
    if (range.second % 2 == 0) range.second--;
  }
  else {
    if (range.first % 2 == 0) range.first++;
    if (range.second % 2 != 0) range.second--;
  }

  if (range.first >= range.second) {
    cout << "No" << endl;
    exit(0);
  }

  if (value[now] != pii(-inf, inf)) {
    assert(value[now].first == value[now].second - 1);
    if (not in(value[now].first, range.first, range.second)) {
      cout << "No" << endl;
      exit(0);
    }
    return value[now];
  }
  value[now] = range;
  return range;
}

void decide(int now, int par) {
  if (par == -1) {
    value[now] = pii(value[now].first, value[now].first + 1);
  }
  else {
    vi ko = {value[par].first - 1, value[par].first + 1};
    rep (i, 2) {
      if (in(ko[i], value[now].first, value[now].second)) {
        value[now].first = ko[i];
        value[now].second = ko[i] + 1;
        break;
      }
    }
  }

  rep (i, G[now].size()) {
    if (G[now][i] == par) continue;
    decide(G[now][i], now);
  }
}


signed main() {
  int n;
  cin >> n;
  rep (i, n - 1) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }

  depth_dfs(0, -1, 0);

  int k;
  cin >> k;
  rep (i, k) {
    int v, p;
    cin >> v >> p;
    v--; 
    if (i == 0) {
      if (depth[v] % 2 == p % 2) even = true;
      else even = false;
    }
    value[v] = pii(p, p + 1);
    if (even) {
      if (p % 2 != depth[v] % 2) {
        cout << "No" << endl;
        return 0;
      }
    }
    else {
      if (p % 2 == depth[v] % 2) {
        cout << "No" << endl;
        return 0;
      }
    }
  }

  //DEBUG_VEC(value);

  dfs(0, -1);
  //DEBUG_VEC(value);

  decide(0, -1);

  cout << "Yes" << endl;
  rep (i, n) {
    cout << value[i].first << endl;
  }
}


Measured memory_bytes: 16512