#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
long long arr[N], P[N], C[N];
vector<int> adj[N];
vector<pair<int, int> > res[N];
int sol[N];
bool valid = true;
void dfs(int v) {
  vector<pair<int, int> > temp;
  for (int u : adj[v]) {
    dfs(u);
    for (pair<int, int> s : res[u]) res[v].push_back(s);
  }
  sort(res[v].begin(), res[v].end());
  if (C[v] > res[v].size()) {
    valid = false;
  } else {
    long long val = 0;
    if (C[v] == 0) {
      val = 1;
    } else {
      val = res[v][C[v] - 1].first + 1;
    }
    for (int i = C[v]; i < res[v].size(); ++i) {
      res[v][i].first += 2;
    }
    res[v].push_back(make_pair(val, v));
    sort(res[v].begin(), res[v].end());
  }
}
int main() {
  int n;
  cin >> n;
  int root = 0;
  for (int i = 1; i <= n; ++i) {
    cin >> P[i] >> C[i];
    adj[P[i]].push_back(i);
    if (P[i] == 0) root = i;
  }
  dfs(root);
  for (pair<int, int> u : res[root]) {
    sol[u.second] = u.first;
  }
  if (!valid) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  for (int i = 1; i <= n; ++i) cout << sol[i] << " ";
  cout << endl;
}
