#include <bits/stdc++.h>
using namespace std;
long long int n, root, noch[2005], p[2005], c[2005], ans[2005], cur = 1;
vector<vector<long long int> > adj(2006);
vector<pair<long long int, long long int> > numof;
vector<long long int> ssol;
void dfss(long long int x) {
  for (auto it : adj[x]) {
    dfss(it);
  }
  ssol.push_back(ans[x]);
}
void dfs(long long int x) {
  long long int su = 0;
  for (auto it : adj[x]) {
    if (!noch[it]) {
      dfs(it);
      su += noch[it] + 1;
    }
  }
  noch[x] = su;
  numof.push_back(make_pair(x, su));
}
bool bo(pair<long long int, long long int> a,
        pair<long long int, long long int> b) {
  return a.second < b.second;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int x, y, z;
  cin >> n;
  for (long long int i = 1; i <= n; i++) {
    cin >> p[i] >> c[i];
    adj[p[i]].push_back(i);
    if (p[i] == 0) {
      root = i;
    }
  }
  dfs(root);
  for (long long int i = 1; i <= n; i++) {
    if (c[i] > noch[i]) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  sort(numof.begin(), numof.end(), bo);
  for (long long int i = 0; i < n; i++) {
    x = numof[i].first;
    y = c[x];
    ssol.clear();
    dfss(x);
    if (y + 1 == ssol.size()) {
      ans[x] = i + 1;
    } else {
      sort(ssol.begin(), ssol.end());
      ans[x] = ssol[y + 1];
      for (long long int j = 1; j <= n; j++) {
        if (j != x && ans[j] >= ans[x]) {
          ans[j]++;
        }
      }
    }
  }
  for (long long int i = 1; i <= n; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
