#include <bits/stdc++.h>
using namespace std;
long long INF = 1e18;
vector<long long> g[2020];
vector<long long> ga[2020];
vector<long long> gb[2020];
long long c[2020];
long long d[2020];
long long vis[2020];
vector<pair<long long, long long>> res;
vector<pair<long long, long long>> inf;
void dfs(long long o, long long v) {
  if (vis[v]) return;
  vis[v] = 1;
  if (v != o) {
    ga[o].push_back(v);
    gb[v].push_back(o);
  }
  for (auto i : g[v]) dfs(o, i);
}
void dfs2(long long p, long long v) {
  if (vis[v]) return;
  vis[v] = 1;
  if (p != -1) d[v] = d[p] + 1;
  for (auto i : g[v]) dfs2(v, i);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  long long root = -1;
  for (int i = 0, ggdem = n; i < ggdem; ++i) {
    long long p;
    cin >> p;
    p--;
    if (p == -1)
      root = i;
    else
      g[p].push_back(i);
    cin >> c[i];
  }
  for (int i = 0, ggdem = n; i < ggdem; ++i) {
    memset((vis), (0), sizeof(vis));
    dfs(i, i);
  }
  memset((vis), (0), sizeof(vis));
  dfs2(-1, root);
  for (int i = 0, ggdem = n; i < ggdem; ++i) {
    inf.push_back({((int)ga[i].size()) - c[i], d[i]});
  }
  while (((int)res.size()) < n) {
    pair<long long, long long> va = {INF, INF};
    long long vai = -1;
    for (int i = 0, ggdem = n; i < ggdem; ++i) {
      if (va > inf[i]) {
        va = inf[i];
        vai = i;
      }
    }
    if (va.first != 0) {
      cout << "NO";
      return 0;
    }
    res.push_back({vai, n - ((int)res.size())});
    for (auto i : gb[vai]) {
      if (inf[i].first != INF) {
        inf[i].first--;
      }
    }
    inf[vai] = {INF, INF};
  }
  sort(res.begin(), res.end());
  cout << "YES\n";
  for (auto i : res) cout << i.second << " ";
  return 0;
}
