/* template.cpp {{{ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define rep1(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, b) rep4(i, a, b, 1)
#define rep4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += (ll)(s))
#define rrep1(n) rrep2(i_, n)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, a, b) rrep4(i, a, b, 1)
#define rrep4(i, a, b, s) for (ll i = (ll)(b) - 1; i >= (ll)(a); i -= (ll)(s))
#define each(x, c) for (auto &&x : c)
#define fs first
#define sc second
#define all(c) begin(c), end(c)
using ui = unsigned;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const int inf = 1e9 + 10;
const ll inf_ll = 1e18 + 10;
const ll mod = 1e9 + 7;
const ll mod9 = 1e9 + 9;
const int dx[]{-1, 0, 1, 0, -1, 1, 1, -1};
const int dy[]{0, -1, 0, 1, -1, -1, 1, 1};
template<class T, class U> void chmin(T &x, const U &y){ x = min<T>(x, y); }
template<class T, class U> void chmax(T &x, const U &y){ x = max<T>(x, y); }
//struct prepare_ { prepare_(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(12); } } prepare__;
/* }}} */

#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
#define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

int n, m;
vector<int> g[100000];
int rt;
int a[100000];
pair<int, int> b[100000];
int res[100000];

bool dfs(int v, int p, int d){
  if (a[v] != -inf && ((a[rt] ^ d ^ a[v]) & 1)) return false;
  each(u, g[v]) if (u != p && !dfs(u, v, d + 1)) return false;
  return true;
}

bool dfs2(int v, int p, int x){
  res[v] = x;
  each(u, g[v]){
    if (u == p) continue;
    bool f = false;
    rep(i, -1, 2, 2){
      if (x + i < b[u].first) continue;
      if (x + i > b[u].second) continue;
      if (f = dfs2(u, v, x + i)) break;
    }
    assert(f); 
  }
  return true;
}

int main(){
  BEGIN_STACK_EXTEND(128 * 1024 * 1024);

  cin >> n;
  rep(i, n - 1){
    int a, b;
    cin >> a >> b, a--, b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  rep(i, n) a[i] = -inf;
  cin >> m;
  rep(i, m){
    int v, p;
    cin >> v >> p, v--;
    a[v] = p;
    rt = v;
  }
  if (!dfs(rt, -1, 0)){
    cout << "No\n";
    return 0;
  }
  //cout << "a\n";
  queue<tuple<int, int, int>> q;
  rep(i, n){
    b[i] = (a[i] != -inf) ? make_pair(a[i], a[i]) : make_pair(-inf, inf);
    if (a[i] != -inf) q.emplace(i, a[i], a[i]);
  }
  while (q.size()){
    int v, aa, bb;
    tie(v, aa, bb) = q.front(), q.pop();
    //cout << v << " " << aa << " " << bb << endl;
    each(u, g[v]){
      int aaa = aa - 1, bbb = bb + 1;
      if (bbb < b[u].first || b[u].second < aaa) cout << "No\n", exit(0);
      if (b[u].first < aaa || bbb < b[u].second){
        b[u] = {max(b[u].first, aaa), min(b[u].second, bbb)};
        q.emplace(u, b[u].first, b[u].second);
      }
    }
  }
  //rep(i, n) cout << b[i].first << " " << b[i].second << endl;
  dfs2(rt, -1, a[rt]);
  cout << "Yes\n";
  rep(i, n) cout << res[i] << endl;

  END_STACK_EXTEND;
}


Measured memory_bytes: 16128