#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

vector<int> mx;
vector<bool> visit;
void dfs(vector<vector<int>> &E, int from, int p){
    visit[from] = 1;
    for(auto to : E[from]){
        if (p == to) continue;
        mx[to] = max(mx[from], mx[to]);
        dfs(E, to, from);
    }
}

int main(){

    int N, Q, t, x, L, A;
    cin >> N;
    vector<vector<int>> E(N);
    mx.resize(N); visit.resize(N);
    for (int i=1; i<N; i++){
        cin >> L >> A; A--;
        mx[i] = L;
        E[A].push_back(i);
    }

    dfs(E, 0, -1);

    vector<int> lv;
    for (int i=0; i<N; i++) if (visit[i]) lv.push_back(mx[i]);
    sort(lv.begin(), lv.end());

    cin >> Q;
    while(Q){
        Q--;
        cin >> t >> x;
        if (t == 1) cout << upper_bound(lv.begin(), lv.end(), x) - lv.begin() << endl;
        else cout << (visit[x-1] ? mx[x-1] : -1) << endl;
    }

    return 0;
}