#include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1.0);
template <class T>
using min_queue = priority_queue<T, vector<T>, greater<T>>;
template <class T>
int sz(const T &first) {
  return (int)first.size();
}
template <class T>
ostream &operator<<(ostream &os, vector<T> &v) {
  os << "\n[";
  for (T &first : v) os << first << ',';
  return os << "]\n";
}
struct pairhash {
 public:
  template <typename T1, typename T2>
  size_t operator()(const pair<T1, T2> &p) const {
    size_t lhs = hash<T1>()(p.first);
    size_t rhs = hash<T2>()(p.second);
    return lhs ^ (rhs + 0x9e3779b9 + (lhs << 6) + (lhs >> 2));
  }
};
bool pos = true;
vector<long long> A, rem;
vector<long long> C;
vector<long long> S;
vector<vector<long long>> adj;
void dfs1(long long i) {
  S[i] = 1;
  for (long long c : adj[i]) {
    dfs1(c);
    S[i] += S[c];
  }
}
void dfs2(long long i) {
  if (C[i] >= S[i]) {
    pos = false;
    return;
  }
  A[i] = rem[C[i]];
  rem.erase(rem.begin() + C[i]);
  for (long long c : adj[i]) {
    dfs2(c);
  }
}
void run() {
  long long n;
  cin >> n;
  A = vector<long long>(n, 0);
  C = vector<long long>(n, 0);
  S = vector<long long>(n, 0);
  adj = vector<vector<long long>>(n);
  for (long long i = 1; i <= n; i++) {
    rem.push_back(i);
  }
  long long root = 0;
  for (long long i = 0; i < n; i++) {
    long long p, c;
    cin >> p >> c;
    C[i] = c;
    if (p == 0) {
      root = i;
    } else {
      adj[p - 1].push_back(i);
    }
  }
  dfs1(root);
  dfs2(root);
  if (pos) {
    cout << "YES" << endl;
    for (long long i = 0; i < n; i++) {
      cout << A[i] << " ";
    }
    cout << endl;
  } else {
    cout << "NO" << endl;
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout << fixed << setprecision(20);
  run();
  return 0;
}
