#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) x = x * 10 + (c & 15), c = getchar();
}
int n, head[2001], cnt, c[2001], a[2001], sz[2001], rt;
bool bb;
struct Edge {
  int a, b;
} e[2001];
inline void add(int a, int b) {
  e[++cnt].a = head[a], e[cnt].b = b, head[a] = cnt;
}
inline void dfs1(int x, int y) {
  if (a[x] >= y) ++a[x];
  for (int i = head[x]; i; i = e[i].a) dfs1(e[i].b, y);
}
inline void dfs2(int x, int y) {
  a[x] += y;
  for (int i = head[x]; i; i = e[i].a) dfs2(e[i].b, y);
}
inline void dfs(int x) {
  for (int i = head[x]; i; i = e[i].a)
    dfs(e[i].b), dfs2(e[i].b, sz[x]), sz[x] += sz[e[i].b];
  ++sz[x];
  if (c[x] >= sz[x]) {
    bb = 1;
    return;
  }
  dfs1(x, c[x] + 1);
  a[x] = c[x] + 1;
}
signed main() {
  read(n);
  for (int i = 1, x; i <= n; i++) {
    read(x), read(c[i]);
    if (x)
      add(x, i);
    else
      rt = i;
  }
  dfs(rt);
  if (bb) {
    printf("NO");
    return 0;
  }
  printf("YES\n");
  for (int i = 1; i <= n; i++) printf("%d ", a[i]);
  return 0;
}
