#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int maxn = 2e3 + 5;
int vis[maxn];
struct Edge {
  int v;
  int next;
} edge[maxn];
int num;
int head[maxn];
int tol;
int val[maxn];
int cc[maxn];
int flag;
void addEdge(int u, int v) {
  edge[tol].v = v;
  edge[tol].next = head[u];
  head[u] = tol++;
}
int cnt[maxn];
int fun(int x) {
  int cnt1 = 0;
  for (int i = 1; i <= num; i++) {
    if (vis[i] == 0) cnt1++;
    if (cnt1 == x) {
      cnt1 = i;
      break;
    }
  }
  return cnt1;
}
void dfs1(int x) {
  cnt[x] = 1;
  for (int i = head[x]; i != 0; i = edge[i].next) {
    int v = edge[i].v;
    dfs1(v);
    cnt[x] += cnt[v];
  }
}
void dfs2(int x) {
  if (cnt[x] - 1 < cc[x]) {
    printf("NO\n");
    exit(0);
  }
  int ele = fun(cc[x] + 1);
  vis[ele] = 1;
  val[x] = ele;
  for (int i = head[x]; i != 0; i = edge[i].next) {
    int v = edge[i].v;
    dfs2(v);
  }
}
int main() {
  scanf("%d", &num);
  int root;
  flag = 0;
  tol = 1;
  for (int i = 1; i <= num; i++) {
    int u, c;
    scanf("%d%d", &u, &c);
    if (u == 0) {
      root = i;
    } else
      addEdge(u, i);
    cc[i] = c;
  }
  dfs1(root);
  dfs2(root);
  printf("YES\n");
  for (int i = 1; i <= num; i++) printf("%d ", val[i]);
  printf("\n");
}
