#include <bits/stdc++.h>
using namespace std;
void die() {
  cout << "NO\n";
  exit(0);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<vector<int>> G(n + 1);
  int root = -1;
  vector<int> a(n + 1);
  for (int i = 1; i <= n; i++) {
    int p;
    cin >> p >> a[i];
    if (p == 0)
      root = i;
    else
      G[p].push_back(i), G[i].push_back(p);
  }
  if (root == -1) die();
  vector<int> st_size(n + 1);
  vector<int> ans(n + 1, -1);
  vector<int> used(n + 1, 0);
  function<void(int, int)> dfs = [&](int u, int p) -> void {
    int cnt = 0, last = 0;
    for (int x = 1; x <= n; x++) {
      if (used[x]) continue;
      cnt++;
      if (cnt == a[u] + 1) {
        last = x;
        break;
      }
    }
    ans[u] = last;
    used[last] = 1;
    st_size[u] = 1;
    for (int v : G[u]) {
      if (v == p) continue;
      dfs(v, u);
      st_size[u] += st_size[v];
    }
    if (!(a[u] <= st_size[u] - 1)) die();
  };
  dfs(root, -1);
  cout << "YES\n";
  for (int i = 1; i <= n; i++) cout << ans[i] << " \n"[i == n];
  return (0);
}
