#include <bits/stdc++.h>
using std::abs;
using std::array;
using std::cerr;
using std::cin;
using std::cout;
using std::generate;
using std::get;
using std::make_pair;
using std::make_tuple;
using std::map;
using std::max;
using std::max_element;
using std::min;
using std::min_element;
using std::pair;
using std::queue;
using std::reverse;
using std::set;
using std::sort;
using std::string;
using std::swap;
using std::tuple;
using std::unique;
using std::vector;
template <typename T>
T input() {
  T res;
  cin >> res;
  {};
  return res;
}
template <typename IT>
void input_seq(IT b, IT e) {
  std::generate(b, e,
                input<typename std::remove_reference<decltype(*b)>::type>);
}
int main() {
  std::iostream::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int n = input<int>();
  vector<int> C(n);
  vector<vector<int>> graph(n);
  int root = -1;
  for (int i = 0; i < n; ++i) {
    int p;
    cin >> p >> C[i];
    --p;
    if (p == -1)
      root = i;
    else
      graph[p].push_back(i);
  }
  std::function<vector<int>(int)> dfs = [&](int v) {
    vector<int> rs;
    for (auto u : graph[v]) {
      auto ch = dfs(u);
      for (int elem : ch) rs.push_back(elem);
    }
    if (C[v] > int((rs).size())) {
      cout << "NO\n";
      exit(0);
    }
    rs.insert(rs.begin() + C[v], v);
    return rs;
  };
  auto rs = dfs(root);
  vector<int> x(n);
  for (int i = 0; i < n; ++i) x[rs[i]] = i + 1;
  cout << "YES\n";
  for (int i = 0; i < n; ++i) cout << x[i] << " \n"[i + 1 == n];
  return 0;
}
