#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005, maxm = 100005, INF = 0x3f3f3f3f;
inline int read() {
  int out = 0, flag = 1;
  char c = getchar();
  while (c < 48 || c > 57) {
    if (c == '-') flag = 0;
    c = getchar();
  }
  while (c >= 48 && c <= 57) {
    out = (out << 1) + (out << 3) + c - 48;
    c = getchar();
  }
  return flag ? out : -out;
}
int ls[maxn], rb[maxn], fa[maxn], c[maxn], n;
int used[maxn], rt, num[maxn];
void dfs(int u) {
  for (int i = 1, cnt = 0; i <= n; i++) {
    if (!used[i]) cnt++;
    if (cnt == c[u] + 1) {
      num[u] = i;
      used[i] = true;
      break;
    }
  }
  for (int k = ls[u]; k; k = rb[k]) {
    dfs(k);
  }
}
int flag, cal[maxn];
void dfs3(int u) {
  cal[num[u]]++;
  for (int k = ls[u]; k; k = rb[k]) dfs3(k);
}
void dfs2(int u) {
  for (int i = 1; i <= (n); i++) cal[i] = 0;
  for (int k = ls[u]; k; k = rb[k]) dfs3(k);
  int cnt = 0;
  for (int i = 1; i < num[u]; i++) cnt += cal[i];
  if (cnt != c[u]) flag = true;
  for (int k = ls[u]; k; k = rb[k]) dfs2(k);
}
int main() {
  n = read();
  for (int i = 1; i <= (n); i++) {
    fa[i] = read(), c[i] = read();
    rb[i] = ls[fa[i]];
    ls[fa[i]] = i;
    if (!fa[i]) rt = i;
  }
  dfs(rt);
  dfs2(rt);
  if (flag)
    puts("NO");
  else {
    puts("YES");
    for (int i = 1; i <= n; i++) printf("%d ", num[i]);
  }
  return 0;
}
