#include <bits/stdc++.h>
using namespace std;
void Fast_IO() {
  ios::sync_with_stdio(0);
  cin.tie(0);
}
long long n, root, poss;
long long parent[2020], want[2020], val[2020];
vector<vector<long long> > adj;
long long assigner[2020];
long long subsize[2020];
void dfs(long long u) {
  subsize[u] = 1;
  for (long long i = (long long)0; i <= (long long)int(adj[u].size()) - 1; i++)
    if (adj[u][i] != parent[u]) dfs(adj[u][i]);
  for (long long i = (long long)0; i <= (long long)int(adj[u].size()) - 1; i++)
    if (adj[u][i] != parent[u]) subsize[u] += subsize[adj[u][i]];
}
void dfs2(long long u) {
  if (want[u] > subsize[u] - 1) {
    poss = 0;
    return;
  }
  val[u] = assigner[want[u]];
  for (long long i = (long long)want[u]; i <= (long long)2018; i++)
    assigner[i] = assigner[i + 1];
  for (long long i = (long long)0; i <= (long long)int(adj[u].size()) - 1; i++)
    if (adj[u][i] != parent[u]) dfs2(adj[u][i]);
}
int main() {
  Fast_IO();
  poss = 1;
  for (long long i = (long long)0; i <= (long long)2019; i++)
    assigner[i] = i + 1;
  cin >> n;
  for (long long i = (long long)0; i <= (long long)n - 1; i++)
    cin >> parent[i] >> want[i];
  for (long long i = (long long)0; i <= (long long)n - 1; i++) parent[i]--;
  adj.resize(n);
  for (long long i = (long long)0; i <= (long long)n - 1; i++) {
    if (parent[i] == -1)
      root = i;
    else {
      adj[i].push_back(parent[i]);
      adj[parent[i]].push_back(i);
    }
  }
  dfs(root);
  dfs2(root);
  if (!poss)
    cout << "NO" << '\n';
  else {
    cout << "YES" << '\n';
    for (long long i = (long long)0; i <= (long long)n - 1; i++)
      cout << val[i] << " ";
  }
  return 0;
}
