#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 2002;
int n;
int p[N_MAX], c[N_MAX];
int root;
vector<int> sons[N_MAX];
int sub[N_MAX];
void dfs(int node) {
  sub[node] = 1;
  for (int u : sons[node]) {
    dfs(u);
    sub[node] += sub[u];
  }
}
void f(int node) {
  while (p[node] != 0) {
    node = p[node];
    sub[node]--;
  }
}
int a[N_MAX];
bool solve(int node, int val) {
  if (a[node] == 0 && c[node] == sub[node] - 1) {
    a[node] = val;
    f(node);
    return true;
  }
  for (int u : sons[node])
    if (solve(u, val) == true) return true;
  return false;
}
int check(int node, int th) {
  int ans = 0;
  if (a[node] < th) ans++;
  for (int u : sons[node]) ans += check(u, th);
  return ans;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> p[i] >> c[i];
    if (p[i] == 0)
      root = i;
    else
      sons[p[i]].push_back(i);
  }
  dfs(root);
  int cnt = n;
  while (cnt > 0) {
    solve(root, cnt);
    cnt--;
  }
  for (int i = 1; i <= n; i++)
    if (a[i] == 0) {
      cout << "NO\n";
      return 0;
    }
  for (int i = 1; i <= n; i++)
    if (check(i, a[i]) != c[i]) {
      cout << "NO\n";
      return 0;
    }
  cout << "YES\n";
  for (int i = 1; i <= n; i++) cout << a[i] << " ";
  cout << "\n";
  return 0;
}
