#include <bits/stdc++.h>
using namespace std;
unsigned int n;
bool correct = true;
vector<unsigned int> a, c, sub_size;
vector<vector<unsigned int>> g;
void calc_size(unsigned int ver) {
  sub_size[ver] = 1;
  for (unsigned int i = 0; i < g[ver].size(); ++i) {
    unsigned int child = g[ver][i];
    calc_size(child);
    sub_size[ver] += sub_size[child];
  }
}
void dfs(unsigned int ver, vector<unsigned int>& nums) {
  if (c[ver] >= nums.size()) correct = false;
  if (!correct) return;
  a[ver] = nums[c[ver]];
  for (unsigned int i = c[ver]; i < nums.size() - 1; ++i) {
    nums[i] = nums[i + 1];
  }
  nums.pop_back();
  vector<vector<unsigned int>> sub_nums(g[ver].size());
  unsigned int ind = 0;
  for (unsigned int i = 0; i < g[ver].size(); ++i) {
    unsigned int child = g[ver][i];
    for (unsigned int j = 0; j < sub_size[child]; ++j) {
      sub_nums[i].push_back(nums[ind]);
      ++ind;
    }
  }
  nums.clear();
  for (unsigned int i = 0; i < g[ver].size(); ++i) {
    unsigned int child = g[ver][i];
    dfs(child, sub_nums[i]);
    if (!correct) return;
  }
}
int main() {
  cin.tie();
  ios_base::sync_with_stdio(0);
  unsigned int n, p, root = 0;
  cin >> n;
  a.resize(n);
  c.resize(n);
  g.resize(n);
  sub_size.resize(n);
  for (unsigned int i = 0; i < n; ++i) {
    cin >> p;
    if (p != 0) {
      --p;
      g[p].push_back(i);
    } else {
      root = i;
    }
    cin >> c[i];
  }
  calc_size(root);
  vector<unsigned int> nums;
  for (unsigned int i = 1; i <= n; ++i) {
    nums.push_back(i);
  }
  dfs(root, nums);
  if (!correct) {
    cout << "NO";
  } else {
    cout << "YES\n";
    for (unsigned int i = 0; i < n; ++i) {
      cout << a[i] << " ";
    }
  }
  return 0;
}
