#include <bits/stdc++.h>
using namespace std;
const long long N = 5e3 + 10, mod = 1e9 + 7, inf = 1e18;
int p[N], c[N], root, n, check = 1, ans[N];
vector<int> G[N];
vector<pair<int, int> > vt[N];
void dfs(int u) {
  for (int v : G[u]) {
    dfs(v);
    int tmp;
    if (vt[u].empty())
      tmp = 0;
    else
      tmp = vt[u].back().first;
    for (pair<int, int> x : vt[v])
      vt[u].push_back(make_pair(x.first + tmp, x.second));
  }
  if (c[u] > (int)vt[u].size()) {
    check = 0;
    return;
  }
  vector<pair<int, int> > tmp;
  for (int i = 0; i < c[u]; i++) tmp.push_back(vt[u][i]);
  tmp.push_back(make_pair(c[u] + 1, u));
  for (int i = c[u]; i < (int)vt[u].size(); i++)
    tmp.push_back(make_pair(vt[u][i].first + 1, vt[u][i].second));
  vt[u] = tmp;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> p[i] >> c[i];
    if (!p[i]) root = i;
    G[p[i]].push_back(i);
  }
  dfs(root);
  if (!check) {
    cout << "NO";
    return 0;
  }
  cout << "YES\n";
  for (pair<int, int> x : vt[root]) ans[x.second] = x.first;
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  return 0;
}
