#include <bits/stdc++.h>

#define fori(i, ini, lim) for(int i = int(ini); i < int(lim); i++)
#define ford(i, ini, lim) for(int i = int(ini); i >= int(lim); i--)

#define debug(x) cout << "> " << #x << " = " << x << endl;
#define debug_at(arr, at) cout << "> " << #arr << "[" << at << "] = " << arr[at] << endl;
#define debug_pair(p) cout << "> " << #p << " = (" << p.first << ", " << p.second << ")" << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

const int MAX = 1e5 + 5;
const int MAX_VAL = 2e5 + 5;
constexpr int BLOCK_SIZE = 1000;
const int BLOCKS = MAX / BLOCK_SIZE + 5;
int start[MAX], ending[MAX], parent[MAX], val[MAX], block[MAX];
int bit[BLOCKS][MAX_VAL], block_start[MAX];
int n;
int dfs_c = 1;
vector<int> adj[MAX];

inline void update(int idx, int v, int b[]) {
 while(idx < MAX_VAL) {
  b[idx] += v;
  idx += idx & -idx;
 }
}

inline int query(int idx, int b[]) {
 int sum = 0;
 while(idx < MAX_VAL) {
  b[idx] += MAX_VAL;
  idx -= idx & -idx;
 }
 return sum;
}

void dfs(int source) {
 start[source] = dfs_c++;
 for(auto &each : adj[source]) {
  dfs(each);
 }
 ending[source] = dfs_c - 1;
}

int main() {
 memset(block_start, -1, sizeof block_start);
 scanf("%d", &n);
 set<int> all;
 fori(i, 1, n + 1) {
  block[i] = i / BLOCK_SIZE;
  if(block_start[block[i]] == -1) {
   block_start[block[i]] = i;
  }
  scanf("%d %d", parent + i, val + i);
  all.insert(val[i]);
  if(i > 1) {
   adj[parent[i]].push_back(i);
  }
 }

 dfs(1);

 vector< tuple<int, int, int> > queries;
 int t, pos, v;
 while(scanf("%d %d %d", &t, &pos, &v) != EOF) {
  queries.emplace_back(t, pos, v);
  all.insert(v);
 }

 int cnt = 1;
 map<int, int> mask;
 for(auto &each : all) {
  mask[each] = cnt++;
 }
 cnt--;

 fori(i, 1, n + 1) {
  val[i] = mask[val[i]];
  update(val[i], 1, bit[block[start[i]]]);
 }

 for(auto &each : queries) {
  tie(t, pos, v) = each;
  v = mask[v];
  if(t == 1) { // update
   update(val[pos], -1, bit[block[start[pos]]]);
   val[pos] = v;
   update(val[pos], 1, bit[block[start[pos]]]);
  }
  else { // query
   int l = start[pos], r = ending[pos];
   int ans = 0;
   if(block[l] == block[r]) {
    fori(i, l, r + 1) {
     ans += val[i] <= v;
    }
   }
   else {
    fori(i, l, block_start[l + 1]) {
     ans += val[i] <= v;
    }
    fori(i, block[l] + 1, block[r]) {
     ans += query(v, bit[i]);
    }
    fori(i, block_start[r], r + 1) {
     ans += val[i] <= v;
    }
   }
   printf("%d\n", ans);
  }
 }

    return 0;
}