#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const long long INF = (long long)5e18;
const int MOD = 998244353;
int _abs(int x) { return x < 0 ? -x : x; }
int add(int x, int y) {
  x += y;
  return x >= MOD ? x - MOD : x;
}
int sub(int x, int y) {
  x -= y;
  return x < 0 ? x + MOD : x;
}
void Add(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
void Sub(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
void Mul(int &x, int y) { x = (long long)(x) * (y) % MOD; }
int qpow(int x, int y) {
  int ret = 1;
  while (y) {
    if (y & 1) ret = (long long)(ret) * (x) % MOD;
    x = (long long)(x) * (x) % MOD;
    y >>= 1;
  }
  return ret;
}
void checkmin(int &x, int y) {
  if (x > y) x = y;
}
void checkmax(int &x, int y) {
  if (x < y) x = y;
}
void checkmin(long long &x, long long y) {
  if (x > y) x = y;
}
void checkmax(long long &x, long long y) {
  if (x < y) x = y;
}
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return x * f;
}
const int N = 2005;
int n;
vector<int> v[N];
int sz[N], c[N], Rt;
void merge(vector<int> &A, vector<int> &B) {
  for (int i = 0; i < (int)(B).size(); i++) A.push_back(B[i]);
  B.clear();
}
void insert(vector<int> &A, int id, int k) {
  vector<int> ret;
  ret.clear();
  if (!k) ret.push_back(id);
  for (int i = 0; i < (int)(A).size(); i++) {
    ret.push_back(A[i]);
    if (i + 1 == k) ret.push_back(id);
  }
  A = ret;
}
vector<int> dfs(int u) {
  sz[u] = 1;
  vector<int> ret;
  for (auto &to : v[u]) {
    vector<int> tmp = dfs(to);
    merge(ret, tmp);
    sz[u] += sz[to];
  }
  if (c[u] >= sz[u]) {
    puts("NO");
    exit(0);
  }
  insert(ret, u, c[u]);
  return ret;
}
int ans[N];
int main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    int fa = read();
    c[i] = read();
    if (!fa)
      Rt = i;
    else
      v[fa].push_back(i);
  }
  vector<int> ret = dfs(Rt);
  for (int i = 0; i < (int)(ret).size(); i++) ans[ret[i]] = i + 1;
  puts("YES");
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  return 0;
}
