#include <bits/stdc++.h>
using namespace std;
const long long N = 2005;
vector<long long> g[N];
long long tin[N], tout[N], tt = 1;
long long c[N], res[N], n, tt2 = 1;
bool ok = 1;
void dfs(long long u, long long p) {
  tin[u] = tt++;
  for (auto v : g[u])
    if (v != p) dfs(v, u);
  tout[u] = tt++;
  vector<pair<long long, long long> > sub;
  for (long long i = 1; i <= n; i++)
    if (u != i && tin[u] <= tin[i] && tout[i] <= tout[u])
      sub.push_back({res[i], i});
  sort(sub.begin(), sub.end());
  if (sub.size() < c[u])
    ok = 0;
  else if (sub.size() == c[u])
    res[u] = tt2;
  else {
    res[u] = sub[c[u]].first;
    for (long long i = c[u]; i < sub.size(); i++) res[sub[i].second]++;
  }
  tt2++;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    long long p;
    cin >> p >> c[i];
    g[p].push_back(i);
  }
  long long r = g[0][0];
  dfs(r, 0);
  if (!ok)
    cout << "NO";
  else {
    cout << "YES\n";
    for (long long i = 1; i <= n; i++) cout << res[i] << " ";
  }
  return 0;
}
