#include <bits/stdc++.h>
using namespace std;
int a[200000];
int c[200000];
vector<int> e[200000];
int p[200000];
int b[200000];
int pp;
bool vv;
int dfs(int k) {
  int re = 0;
  for (int i = 0; i < int(e[k].size()); i++) re += dfs(e[k][i]);
  if (a[k] > re) vv = false;
  b[k] = re + 1;
  return (re + 1);
}
vector<pair<int, int> > dfs2(int k) {
  vector<pair<int, int> > q;
  vector<pair<int, int> > qq;
  if (b[k] == 1) {
    c[k] = 1;
    qq.push_back(make_pair(c[k], k));
    return qq;
  }
  for (int i = 0; i < int(e[k].size()); i++) {
    q = dfs2(e[k][i]);
    for (int i = 0; i < int(q.size()); i++) {
      qq.push_back(q[i]);
    }
  }
  sort(qq.begin(), qq.end());
  c[k] = a[k] + 1;
  for (int i = 0; i < int(qq.size()); i++) {
    if (i < a[k]) {
      qq[i].first = i + 1;
      c[qq[i].second] = qq[i].first;
    } else {
      qq[i].first = i + 2;
      c[qq[i].second] = qq[i].first;
    }
  }
  qq.push_back(make_pair(c[k], k));
  return qq;
}
int main() {
  for (int i = 0; i < int(200000); i++) a[i] = 0;
  int n, k;
  int x, y, z;
  scanf("%d", &n);
  for (int i = 0; i < int(n); i++) {
    scanf("%d %d", &p[i], &a[i]);
    p[i]--;
    if (p[i] >= 0)
      e[p[i]].push_back(i);
    else
      pp = i;
  }
  vv = true;
  dfs(pp);
  if (!vv) {
    printf("NO\n");
    return 0;
  }
  dfs2(pp);
  printf("YES\n");
  for (int i = 0; i < int(n); i++) {
    printf("%d", c[i]);
    if (i < (n - 1))
      printf(" ");
    else
      printf("\n");
  }
  return 0;
}
