#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10;
vector<int> E[N];
int a[N], c[N];
int n;
vector<int> dfs(int x) {
  vector<int> ans;
  for (int i = 0; i < E[x].size(); i++) {
    vector<int> tmp = dfs(E[x][i]);
    for (int j = 0; j < tmp.size(); j++) {
      ans.push_back(tmp[j]);
    }
  }
  if (x == 0) return ans;
  if (ans.size() < c[x]) {
    puts("NO");
    exit(0);
  }
  vector<int> ans_;
  for (int i = 0; i < c[x]; i++) {
    ans_.push_back(ans[i]);
  }
  ans_.push_back(x);
  for (int i = c[x]; i < ans.size(); i++) {
    ans_.push_back(ans[i]);
  }
  return ans_;
}
int main() {
  scanf("%d", &n);
  int fa;
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &fa, c + i);
    E[fa].push_back(i);
  }
  vector<int> ans = dfs(0);
  puts("YES");
  for (int i = 0; i < ans.size(); i++) {
    a[ans[i]] = i + 1;
  }
  for (int i = 1; i <= n; i++) {
    printf("%d ", a[i]);
  }
  puts("");
  return 0;
}
