#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops", "no-stack-protector")
#pragma GCC optimize("Ofast", "fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
int n;
vector<vector<int> > g;
vector<int> c;
vector<int> a;
vector<int> siz;
vector<int> p;
int cnt = 1;
void precalc(int v) {
  siz[v] = 1;
  for (auto to : g[v]) {
    precalc(to);
    siz[v] += siz[to];
  }
  if (c[v] >= siz[v]) {
    cout << "NO";
    exit(0);
  }
}
vector<pair<int, int> > buf;
void get(int v) {
  buf.push_back({a[v], v});
  for (auto to : g[v]) {
    get(to);
  }
}
void f(int v) {
  for (auto to : g[v]) {
    f(to);
  }
  if (g[v].size() == 0) {
    a[v] = cnt;
    cnt++;
    return;
  }
  if (c[v] == siz[v] - 1) {
    a[v] = cnt;
    cnt++;
    return;
  }
  buf.clear();
  for (auto to : g[v]) {
    get(to);
  }
  sort(buf.begin(), buf.end());
  a[v] = buf[c[v]].first;
  for (int i = c[v]; i < buf.size(); i++) {
    a[buf[i].second]++;
  }
  cnt++;
  return;
}
int main() {
  cin >> n;
  p.resize(n);
  siz.resize(n);
  a.resize(n);
  c.resize(n);
  g.resize(n);
  int r = 0;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x >> c[i];
    x--;
    if (x == -1) {
      r = i;
      continue;
    }
    p[i] = x;
    g[x].push_back(i);
  }
  precalc(r);
  cout << "YES\n";
  f(r);
  for (int i = 0; i < n; i++) cout << a[i] << " ";
}
