Problem p03949 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize

#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)

#define sort_by(x, y)                                                          \
  sort(all(x), [&](const auto &a, const auto &b) { return y; })

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;

using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using vpdd = vector<pdd>;
using vvpdd = vector<vpdd>;

template <typename T> void ckmin(T &a, const T &b) { a = min(a, b); }
template <typename T> void ckmax(T &a, const T &b) { a = max(a, b); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

namespace __input {
template <class T1, class T2> void re(pair<T1, T2> &p);
template <class T> void re(vector<T> &a);
template <class T, size_t SZ> void re(array<T, SZ> &a);

template <class T> void re(T &x) { cin >> x; }
void re(double &x) {
  string t;
  re(t);
  x = stod(t);
}
template <class Arg, class... Args> void re(Arg &first, Args &...rest) {
  re(first);
  re(rest...);
}

template <class T1, class T2> void re(pair<T1, T2> &p) { re(p.f, p.s); }
template <class T> void re(vector<T> &a) { F0R(i, sz(a)) re(a[i]); }
template <class T, size_t SZ> void re(array<T, SZ> &a) { F0R(i, SZ) re(a[i]); }
} // namespace __input
using namespace __input;

namespace __output {
template <class T1, class T2> void pr(const pair<T1, T2> &x);
template <class T, size_t SZ> void pr(const array<T, SZ> &x);
template <class T> void pr(const vector<T> &x);
template <class T> void pr(const deque<T> &x);
template <class T> void pr(const set<T> &x);
template <class T1, class T2> void pr(const map<T1, T2> &x);

template <class T> void pr(const T &x) { cout << x; }
template <class Arg, class... Args>
void pr(const Arg &first, const Args &...rest) {
  pr(first);
  pr(rest...);
}

template <class T1, class T2> void pr(const pair<T1, T2> &x) {
  pr("{", x.f, ", ", x.s, "}");
}
template <class T, bool pretty = true> void prContain(const T &x) {
  if (pretty)
    pr("{");
  bool fst = 1;
  for (const auto &a : x)
    pr(!fst ? pretty ? ", " : " " : "", a), fst = 0;
  if (pretty)
    pr("}");
}
template <class T> void pc(const T &x) {
  prContain<T, false>(x);
  pr("\n");
}
template <class T, size_t SZ> void pr(const array<T, SZ> &x) { prContain(x); }
template <class T> void pr(const vector<T> &x) { prContain(x); }
template <class T> void pr(const deque<T> &x) { prContain(x); }
template <class T> void pr(const set<T> &x) { prContain(x); }
template <class T1, class T2> void pr(const map<T1, T2> &x) { prContain(x); }

void ps() { pr("\n"); }
template <class Arg> void ps(const Arg &first) {
  pr(first);
  ps();
}
template <class Arg, class... Args>
void ps(const Arg &first, const Args &...rest) {
  pr(first, " ");
  ps(rest...);
}
} // namespace __output
using namespace __output;

#define TRACE(x) x
#define __pn(x) pr(#x, " = ")
#define pd(...) __pn((__VA_ARGS__)), ps(__VA_ARGS__), cout << flush

namespace __algorithm {
template <typename T> void dedup(vector<T> &v) {
  sort(all(v));
  v.erase(unique(all(v)), v.end());
}
template <typename T>
typename vector<T>::iterator find(vector<T> &v, const T &x) {
  auto it = lower_bound(all(v), x);
  return it != v.end() && *it == x ? it : v.end();
}
template <typename T> size_t index(vector<T> &v, const T &x) {
  auto it = find(v, x);
  assert(it != v.end() && *it == x);
  return it - v.begin();
}
template <typename C, typename T, typename OP>
vector<T> prefixes(const C &v, T id, OP op) {
  vector<T> r(sz(v) + 1, id);
  F0R(i, sz(v)) r[i + 1] = op(r[i], v[i]);
  return r;
}
template <typename C, typename T, typename OP>
vector<T> suffixes(const C &v, T id, OP op) {
  vector<T> r(sz(v) + 1, id);
  F0Rd(i, sz(v)) r[i] = op(v[i], r[i + 1]);
  return r;
}
} // namespace __algorithm
using namespace __algorithm;

struct monostate {
  friend istream &operator>>(istream &is,
                             const __attribute__((unused)) monostate &ms) {
    return is;
  }
  friend ostream &operator<<(ostream &os,
                             const __attribute__((unused)) monostate &ms) {
    return os;
  }
} ms;

template <typename W = monostate> struct wedge {
  int u, v, i;
  W w;
  wedge<W>(int _u = -1, int _v = -1, int _i = -1) : u(_u), v(_v), i(_i) {}
  int operator[](int loc) const { return u ^ v ^ loc; }
  friend void re(wedge &e) {
    re(e.u, e.v, e.w);
    --e.u, --e.v;
  }
  friend void pr(const wedge &e) { pr(e.u, "<-", e.w, "->", e.v); }
};

namespace __io {
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
void setIO(string s = "") {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(15);
  if (sz(s)) {
    setIn(s + ".in"), setOut(s + ".out");
  }
}
} // namespace __io
using namespace __io;
// }}}

// sparse_table {{{
template <typename T, typename F> struct sparse_table {
  int SZ;
  F tt; // idempotent
  vector<T> table;

  T &entry(int l, int i) { return table[l * SZ + i]; }
  const T &entry(int l, int i) const { return table[l * SZ + i]; }

  sparse_table() {}
  sparse_table(const vector<T> &elts, F _tt) : SZ(sz(elts)), tt(_tt) {
    const int L = 32 - __builtin_clz(max(SZ - 1, 1));
    table.resize(L * SZ);
    copy(all(elts), table.begin());

    for (int l = 0; l + 1 < L; l++) {
      for (int i = 0; i < SZ; i++) {
        entry(l + 1, i) = entry(l, i);
        if (i + (1 << l) < SZ)
          entry(l + 1, i) = tt(entry(l + 1, i), entry(l, i + (1 << l)));
      }
    }
  }

  // Accumulates the elements at indices in [i, j) in O(1)
  T operator()(int i, int j) const {
    assert(0 <= i && i < j && j <= SZ);
    int l = j - i - 1 ? 31 - __builtin_clz(j - i - 1) : 0;
    return tt(entry(l, i), entry(l, j - (1 << l)));
  }
};
// }}}
// tree {{{
template <typename E> struct tree {
  int V;
  vvi nbrs;
  vector<vector<reference_wrapper<E>>> edges;
  vector<E> edge_list;

  tree(int _V = 0) : V(_V) {}
  tree(const vector<E> &__edge_list)
      : V(sz(__edge_list) + 1), edge_list(__edge_list) {
    nbrs.resize(V), edges.resize(V);
    for (E &e : edge_list) {
      assert(0 <= e.u && e.u < V && 0 <= e.v && e.v < V);
      nbrs[e.u].push_back(e.v);
      nbrs[e.v].push_back(e.u);
      edges[e.u].pb(e);
      edges[e.v].pb(e);
    }
    erased.resize(V), subt_sz.resize(V);
  }

  friend void re(tree &t) {
    assert(t.V > 0);
    vector<E> __edge_list(t.V - 1);
    re(__edge_list);
    for (int i = 0; i < t.V - 1; i++)
      __edge_list[i].i = i;
    t = tree<E>(__edge_list);
  }
  friend void pr(const tree &t) { pr("{V=", t.V, " ", t.edge_list, "}"); }

  vb erased;
  void erase(int u) { erased[u] = true; }

  mutable vi subt_sz;
  void calc_subt_sz(int u, bool avoid_erased, int p) const {
    subt_sz[u] = 1;
    for (int v : nbrs[u])
      if (v != p && (!avoid_erased || !erased[v])) {
        calc_subt_sz(v, avoid_erased, u);
        subt_sz[u] += subt_sz[v];
      }
  }

  vi centroids(int r = 0, bool avoid_erased = 1) const {
    calc_subt_sz(r, avoid_erased, -1);
    int c = r, p = -1;
  FIND:
    for (int u : nbrs[c])
      if (!avoid_erased || !erased[u]) {
        if (subt_sz[u] < subt_sz[c] && 2 * subt_sz[u] >= subt_sz[r]) {
          p = c, c = u;
          goto FIND;
        }
      }
    return subt_sz[c] * 2 == subt_sz[r] ? vi{c, p} : vi{c};
  }
};
// }}}
// lowest_common_ancestor {{{
template <typename E> struct lowest_common_ancestor {
  tree<E> t;
  int root;
  vi _par, _depth, _subt_sz;

  const vi &nbrs(int v) const { return t.nbrs[v]; }
  int par(int v) const { return _par[v]; }
  int depth(int v) const { return _depth[v]; }
  int subt_sz(int v) const { return _subt_sz[v]; }

  struct visit {
    int node, depth, index;
  };
  struct adder {
    visit operator()(const visit &a, const visit &b) const {
      if (a.depth != b.depth)
        return a.depth < b.depth ? a : b;
      return a.index > b.index ? a : b;
    }
  } vv;

  vector<visit> euler_tour;
  vi first_visit;
  sparse_table<visit, adder> table;

  lowest_common_ancestor() {}
  lowest_common_ancestor(tree<E> _t, int _root = 0) : t(_t), root(_root) {
    _par.resz(t.V, -1), _depth.resz(t.V), _subt_sz.resz(t.V),
        first_visit.resz(t.V);
    auto dfs = [&](auto &self, int loc) -> void {
      _subt_sz[loc] = 1;
      first_visit[loc] = sz(euler_tour);
      euler_tour.pb({loc, _depth[loc], sz(euler_tour)});

      for (int nbr : this->nbrs(loc))
        if (nbr != this->par(loc)) {
          _par[nbr] = loc;
          _depth[nbr] = this->depth(loc) + 1;
          self(self, nbr);
          _subt_sz[loc] += this->subt_sz(nbr);
          euler_tour.push_back({loc, this->depth(loc), sz(euler_tour)});
        }
    };
    dfs(dfs, root);
    table = sparse_table<visit, adder>(euler_tour, vv);
  }

  int lca(int u, int v) const {
    u = first_visit[u], v = first_visit[v];
    if (u > v)
      swap(u, v);
    return table(u, v + 1).node;
  }

  int dist(int u, int v) const {
    return depth(u) + depth(v) - 2 * depth(lca(u, v));
  }

  bool uv_path_has_w(int u, int v, int w) const {
    return w != -1 && dist(u, v) == (dist(u, w) + dist(w, v));
  }

  // Returns the neighbor of u on the simple path from u to v
  int first_step(int u, int v) const {
    assert(u != v);
    if (lca(u, v) != u)
      return par(u);
    return euler_tour[table(first_visit[u], first_visit[v]).index + 1].node;
  }

  template <typename T, typename F> vector<T> prefix_sums(T id, F op) {
    vector<T> res(t.V, id);
    auto dfs = [&](auto &self, int loc) -> void {
      for (int eid : t.eids[loc]) {
        E &e = t.edges[eid];
        int nbr = e[loc];
        if (nbr == par(loc))
          continue;
        res[nbr] = op(res[loc], e);
        self(self, nbr);
      }
    };
    dfs(dfs, root);
    return res;
  }
  template <typename T> T read_path(vector<T> prefix_sums, int u, int v) {
    return prefix_sums[u] + prefix_sums[v] - 2 * prefix_sums[lca(u, v)];
  }
};
// }}}

int main() {
  setIO();

  int N;
  re(N);

  using E = wedge<>;
  tree<E> tr(N);
  re(tr);
  lowest_common_ancestor<E> lca(tr);

  const pii ANY{INT_MIN, INT_MAX};
  vpii bounds(N, ANY);

  vi nodes;
  int K;
  re(K);
  F0R(k, K) {
    int v, p;
    re(v, p);
    --v;
    nodes.pb(v);
    bounds[v] = {p, p};
  }

  sort_by(nodes, lca.first_visit[a] < lca.first_visit[b]);
  FORd(i, 1, sz(nodes)) nodes.pb(lca.lca(nodes[i - 1], nodes[i]));

  vb junc(N);
  trav(u, nodes) junc[u] = 1;

  auto isect = [&](pii &targ, pii src) {
    if (src == ANY)
      return;
    if (targ != ANY && ((targ.f ^ src.f) & 1)) {
      ps("No");
      exit(0);
    }
    ckmax(targ.f, src.f);
    ckmin(targ.s, src.s);
    if (targ.f > targ.s) {
      ps("No");
      exit(0);
    }
  };

  auto spread = [&](auto &self, int u, int p) -> void {
    trav(v, tr.nbrs[u]) {
      isect(bounds[v], {bounds[u].f - 1, bounds[u].s + 1});
      if (v != p && !junc[v])
        self(self, v, u);
    }
  };

  sort_by(nodes, lca.first_visit[a] > lca.first_visit[b]);
  trav(u, nodes) if (bounds[u] != ANY) spread(spread, u, u);
  reverse(all(nodes));
  trav(u, nodes) if (bounds[u] != ANY) spread(spread, u, u);

  ps("Yes");
  F0R(i, N) ps(bounds[i].f);

  // did you check N=1? did you mix up N,M?
  return 0;
}


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

// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize

#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)

#define sort_by(x, y)                                                          \
  sort(all(x), [&](const auto &a, const auto &b) { return y; })

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;

using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using vpdd = vector<pdd>;
using vvpdd = vector<vpdd>;

template <typename T> void ckmin(T &a, const T &b) { a = min(a, b); }
template <typename T> void ckmax(T &a, const T &b) { a = max(a, b); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

namespace __input {
template <class T1, class T2> void re(pair<T1, T2> &p);
template <class T> void re(vector<T> &a);
template <class T, size_t SZ> void re(array<T, SZ> &a);

template <class T> void re(T &x) { cin >> x; }
void re(double &x) {
  string t;
  re(t);
  x = stod(t);
}
template <class Arg, class... Args> void re(Arg &first, Args &...rest) {
  re(first);
  re(rest...);
}

template <class T1, class T2> void re(pair<T1, T2> &p) { re(p.f, p.s); }
template <class T> void re(vector<T> &a) { F0R(i, sz(a)) re(a[i]); }
template <class T, size_t SZ> void re(array<T, SZ> &a) { F0R(i, SZ) re(a[i]); }
} // namespace __input
using namespace __input;

namespace __output {
template <class T1, class T2> void pr(const pair<T1, T2> &x);
template <class T, size_t SZ> void pr(const array<T, SZ> &x);
template <class T> void pr(const vector<T> &x);
template <class T> void pr(const deque<T> &x);
template <class T> void pr(const set<T> &x);
template <class T1, class T2> void pr(const map<T1, T2> &x);

template <class T> void pr(const T &x) { cout << x; }
template <class Arg, class... Args>
void pr(const Arg &first, const Args &...rest) {
  pr(first);
  pr(rest...);
}

template <class T1, class T2> void pr(const pair<T1, T2> &x) {
  pr("{", x.f, ", ", x.s, "}");
}
template <class T, bool pretty = true> void prContain(const T &x) {
  if (pretty)
    pr("{");
  bool fst = 1;
  for (const auto &a : x)
    pr(!fst ? pretty ? ", " : " " : "", a), fst = 0;
  if (pretty)
    pr("}");
}
template <class T> void pc(const T &x) {
  prContain<T, false>(x);
  pr("\n");
}
template <class T, size_t SZ> void pr(const array<T, SZ> &x) { prContain(x); }
template <class T> void pr(const vector<T> &x) { prContain(x); }
template <class T> void pr(const deque<T> &x) { prContain(x); }
template <class T> void pr(const set<T> &x) { prContain(x); }
template <class T1, class T2> void pr(const map<T1, T2> &x) { prContain(x); }

void ps() { pr("\n"); }
template <class Arg> void ps(const Arg &first) {
  pr(first);
  ps();
}
template <class Arg, class... Args>
void ps(const Arg &first, const Args &...rest) {
  pr(first, " ");
  ps(rest...);
}
} // namespace __output
using namespace __output;

#define TRACE(x) x
#define __pn(x) pr(#x, " = ")
#define pd(...) __pn((__VA_ARGS__)), ps(__VA_ARGS__), cout << flush

namespace __algorithm {
template <typename T> void dedup(vector<T> &v) {
  sort(all(v));
  v.erase(unique(all(v)), v.end());
}
template <typename T>
typename vector<T>::iterator find(vector<T> &v, const T &x) {
  auto it = lower_bound(all(v), x);
  return it != v.end() && *it == x ? it : v.end();
}
template <typename T> size_t index(vector<T> &v, const T &x) {
  auto it = find(v, x);
  assert(it != v.end() && *it == x);
  return it - v.begin();
}
template <typename C, typename T, typename OP>
vector<T> prefixes(const C &v, T id, OP op) {
  vector<T> r(sz(v) + 1, id);
  F0R(i, sz(v)) r[i + 1] = op(r[i], v[i]);
  return r;
}
template <typename C, typename T, typename OP>
vector<T> suffixes(const C &v, T id, OP op) {
  vector<T> r(sz(v) + 1, id);
  F0Rd(i, sz(v)) r[i] = op(v[i], r[i + 1]);
  return r;
}
} // namespace __algorithm
using namespace __algorithm;

struct monostate {
  friend istream &operator>>(istream &is,
                             const __attribute__((unused)) monostate &ms) {
    return is;
  }
  friend ostream &operator<<(ostream &os,
                             const __attribute__((unused)) monostate &ms) {
    return os;
  }
} ms;

template <typename W = monostate> struct wedge {
  int u, v, i;
  W w;
  wedge<W>(int _u = -1, int _v = -1, int _i = -1) : u(_u), v(_v), i(_i) {}
  int operator[](int loc) const { return u ^ v ^ loc; }
  friend void re(wedge &e) {
    re(e.u, e.v, e.w);
    --e.u, --e.v;
  }
  friend void pr(const wedge &e) { pr(e.u, "<-", e.w, "->", e.v); }
};

namespace __io {
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
void setIO(string s = "") {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(15);
  if (sz(s)) {
    setIn(s + ".in"), setOut(s + ".out");
  }
}
} // namespace __io
using namespace __io;
// }}}

// sparse_table {{{
template <typename T, typename F> struct sparse_table {
  int SZ;
  F tt; // idempotent
  vector<T> table;

  T &entry(int l, int i) { return table[l * SZ + i]; }
  const T &entry(int l, int i) const { return table[l * SZ + i]; }

  sparse_table() {}
  sparse_table(const vector<T> &elts, F _tt) : SZ(sz(elts)), tt(_tt) {
    const int L = 32 - __builtin_clz(max(SZ - 1, 1));
    table.resize(L * SZ);
    copy(all(elts), table.begin());

    for (int l = 0; l + 1 < L; l++) {
      for (int i = 0; i < SZ; i++) {
        entry(l + 1, i) = entry(l, i);
        if (i + (1 << l) < SZ)
          entry(l + 1, i) = tt(entry(l + 1, i), entry(l, i + (1 << l)));
      }
    }
  }

  // Accumulates the elements at indices in [i, j) in O(1)
  T operator()(int i, int j) const {
    assert(0 <= i && i < j && j <= SZ);
    int l = j - i - 1 ? 31 - __builtin_clz(j - i - 1) : 0;
    return tt(entry(l, i), entry(l, j - (1 << l)));
  }
};
// }}}
// tree {{{
template <typename E> struct tree {
  int V;
  vvi nbrs;
  vector<vector<reference_wrapper<E>>> edges;
  vector<E> edge_list;

  tree(int _V = 0) : V(_V) {}
  tree(const vector<E> &__edge_list)
      : V(sz(__edge_list) + 1), edge_list(__edge_list) {
    nbrs.resize(V), edges.resize(V);
    for (E &e : edge_list) {
      assert(0 <= e.u && e.u < V && 0 <= e.v && e.v < V);
      nbrs[e.u].push_back(e.v);
      nbrs[e.v].push_back(e.u);
      edges[e.u].pb(e);
      edges[e.v].pb(e);
    }
    erased.resize(V), subt_sz.resize(V);
  }

  friend void re(tree &t) {
    assert(t.V > 0);
    vector<E> __edge_list(t.V - 1);
    re(__edge_list);
    for (int i = 0; i < t.V - 1; i++)
      __edge_list[i].i = i;
    t = tree<E>(__edge_list);
  }
  friend void pr(const tree &t) { pr("{V=", t.V, " ", t.edge_list, "}"); }

  vb erased;
  void erase(int u) { erased[u] = true; }

  mutable vi subt_sz;
  void calc_subt_sz(int u, bool avoid_erased, int p) const {
    subt_sz[u] = 1;
    for (int v : nbrs[u])
      if (v != p && (!avoid_erased || !erased[v])) {
        calc_subt_sz(v, avoid_erased, u);
        subt_sz[u] += subt_sz[v];
      }
  }

  vi centroids(int r = 0, bool avoid_erased = 1) const {
    calc_subt_sz(r, avoid_erased, -1);
    int c = r, p = -1;
  FIND:
    for (int u : nbrs[c])
      if (!avoid_erased || !erased[u]) {
        if (subt_sz[u] < subt_sz[c] && 2 * subt_sz[u] >= subt_sz[r]) {
          p = c, c = u;
          goto FIND;
        }
      }
    return subt_sz[c] * 2 == subt_sz[r] ? vi{c, p} : vi{c};
  }
};
// }}}
// lowest_common_ancestor {{{
template <typename E> struct lowest_common_ancestor {
  tree<E> t;
  int root;
  vi _par, _depth, _subt_sz;

  const vi &nbrs(int v) const { return t.nbrs[v]; }
  int par(int v) const { return _par[v]; }
  int depth(int v) const { return _depth[v]; }
  int subt_sz(int v) const { return _subt_sz[v]; }

  struct visit {
    int node, depth, index;
  };
  struct adder {
    visit operator()(const visit &a, const visit &b) const {
      if (a.depth != b.depth)
        return a.depth < b.depth ? a : b;
      return a.index > b.index ? a : b;
    }
  } vv;

  vector<visit> euler_tour;
  vi first_visit;
  sparse_table<visit, adder> table;

  lowest_common_ancestor() {}
  lowest_common_ancestor(tree<E> _t, int _root = 0) : t(_t), root(_root) {
    _par.resz(t.V, -1), _depth.resz(t.V), _subt_sz.resz(t.V),
        first_visit.resz(t.V);
    auto dfs = [&](auto &self, int loc) -> void {
      _subt_sz[loc] = 1;
      first_visit[loc] = sz(euler_tour);
      euler_tour.pb({loc, _depth[loc], sz(euler_tour)});

      for (int nbr : this->nbrs(loc))
        if (nbr != this->par(loc)) {
          _par[nbr] = loc;
          _depth[nbr] = this->depth(loc) + 1;
          self(self, nbr);
          _subt_sz[loc] += this->subt_sz(nbr);
          euler_tour.push_back({loc, this->depth(loc), sz(euler_tour)});
        }
    };
    dfs(dfs, root);
    table = sparse_table<visit, adder>(euler_tour, vv);
  }

  int lca(int u, int v) const {
    u = first_visit[u], v = first_visit[v];
    if (u > v)
      swap(u, v);
    return table(u, v + 1).node;
  }

  int dist(int u, int v) const {
    return depth(u) + depth(v) - 2 * depth(lca(u, v));
  }

  bool uv_path_has_w(int u, int v, int w) const {
    return w != -1 && dist(u, v) == (dist(u, w) + dist(w, v));
  }

  // Returns the neighbor of u on the simple path from u to v
  int first_step(int u, int v) const {
    assert(u != v);
    if (lca(u, v) != u)
      return par(u);
    return euler_tour[table(first_visit[u], first_visit[v]).index + 1].node;
  }

  template <typename T, typename F> vector<T> prefix_sums(T id, F op) {
    vector<T> res(t.V, id);
    auto dfs = [&](auto &self, int loc) -> void {
      for (int eid : t.eids[loc]) {
        E &e = t.edges[eid];
        int nbr = e[loc];
        if (nbr == par(loc))
          continue;
        res[nbr] = op(res[loc], e);
        self(self, nbr);
      }
    };
    dfs(dfs, root);
    return res;
  }
  template <typename T> T read_path(vector<T> prefix_sums, int u, int v) {
    return prefix_sums[u] + prefix_sums[v] - 2 * prefix_sums[lca(u, v)];
  }
};
// }}}

int main() {
  setIO();

  int N;
  re(N);

  using E = wedge<>;
  tree<E> tr(N);
  re(tr);
  lowest_common_ancestor<E> lca(tr);

  const pii ANY{INT_MIN, INT_MAX};
  vpii bounds(N, ANY);

  vi nodes;
  int K;
  re(K);
  F0R(k, K) {
    int v, p;
    re(v, p);
    --v;
    nodes.pb(v);
    bounds[v] = {p, p};
  }

  sort_by(nodes, lca.first_visit[a] < lca.first_visit[b]);
  FORd(i, 1, sz(nodes)) nodes.pb(lca.lca(nodes[i - 1], nodes[i]));

  vb junc(N);
  trav(u, nodes) junc[u] = 1;

  auto isect = [&](pii &targ, pii src) {
    if (src == ANY)
      return;
    if (targ != ANY && ((targ.f ^ src.f) & 1)) {
      ps("No");
      exit(0);
    }
    ckmax(targ.f, src.f);
    ckmin(targ.s, src.s);
    if (targ.f > targ.s) {
      ps("No");
      exit(0);
    }
  };

  auto spread = [&](auto &self, int u, int p) -> void {
    trav(v, tr.nbrs[u]) {
      isect(bounds[v], {bounds[u].f - 1, bounds[u].s + 1});
      if (v != p && !junc[v])
        self(self, v, u);
    }
  };

  sort_by(nodes, lca.first_visit[a] > lca.first_visit[b]);
  nodes.erase(unique(all(nodes)), nodes.end());
  trav(u, nodes) if (bounds[u] != ANY) spread(spread, u, u);
  reverse(all(nodes));
  trav(u, nodes) if (bounds[u] != ANY) spread(spread, u, u);

  ps("Yes");
  F0R(i, N) ps(bounds[i].f);

  // did you check N=1? did you mix up N,M?
  return 0;
}