#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long qpow(long long a, long long b, long long m) {
  long long r = 1;
  a %= m;
  for (; b; b >>= 1) {
    if (b & 1) r = r * a % m;
    a = a * a % m;
  }
  return r;
}
const int inf = 0x7fffffff;
const int maxn = 2e3 + 10;
vector<int> g[maxn];
int cnt[maxn];
int c[maxn];
int n, rt;
void dfs0(int u) {
  cnt[u] = 1;
  for (int v : g[u]) {
    dfs0(v);
    cnt[u] += cnt[v];
  }
}
vector<int> ve[maxn];
int xx = 3000, tt = 0;
int val[maxn];
map<int, int> mp;
void dfs(int u) {
  for (int v : g[u]) {
    dfs(v);
    for (int x : ve[v]) ve[u].push_back(x);
  }
  if ((int)(g[u]).size()) {
    vector<int>::iterator it = ve[u].begin();
    for (int i = 0; i < c[u]; i++) it++;
    ve[u].insert(it, 1, u);
  } else
    ve[u].push_back(u);
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int p;
    cin >> p >> c[i];
    if (!p)
      rt = i;
    else
      g[p].push_back(i);
  }
  dfs0(rt);
  for (int i = 1; i <= n; i++)
    if (c[i] >= cnt[i]) {
      cout << "NO" << endl;
      return 0;
    }
  dfs(rt);
  cout << "YES" << endl;
  int ttt = 0;
  for (int i = 0; i < n; i++) {
    val[ve[rt][i]] = ++ttt;
  }
  for (int i = 1; i <= n; i++) {
    if (i - 1) cout << " ";
    cout << val[i];
  }
  cout << endl;
  return 0;
}
