#include <bits/stdc++.h>
using namespace std;
int solve(vector<vector<int> > &gr, vector<int> &ord, vector<int> &c, int u) {
  int v;
  int ch = 0;
  int isz = ord.size();
  for (int i = 0; i < gr[u].size(); ++i) {
    v = gr[u][i];
    int tmp = solve(gr, ord, c, v);
    if (tmp == -1) return -1;
    ch += (tmp + 1);
  }
  if (c[u] > ch) return -1;
  auto it = ord.begin();
  if (isz + c[u] >= ord.size())
    it = ord.end();
  else
    it += isz + c[u];
  ord.insert(it, u);
  return ch;
}
int main() {
  int n;
  cin >> n;
  vector<vector<int> > gr(n);
  vector<int> c(n);
  int p;
  int root;
  for (int i = 0; i < n; ++i) {
    cin >> p >> c[i];
    p--;
    if (p != -1) gr[p].push_back(i);
    if (p == -1) root = i;
  }
  vector<int> ord;
  int tmp = solve(gr, ord, c, root);
  if (tmp == -1)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    vector<int> val(n);
    for (int i = 0; i < n; ++i) {
      val[ord[i]] = i + 1;
    }
    for (int i = 0; i < n; ++i) {
      cout << val[i] << " ";
    }
    cout << endl;
  }
  return 0;
}
