#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (1LL << 60)
#define all(v) (v).begin(), (v).end()

template <class T>
void chmin(T &a, T b) {
    if (a > b) a = b;
}

template <class T>
void chmax(T &a, T b) {
    if (a < b) a = b;
}
long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

// a^-1
long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}

int main() {
    ll N;
    cin >> N;
    vector<ll> L(N), A(N);
    rep(i, N - 1) {
        cin >> L[i + 1] >> A[i + 1];
        A[i + 1]--;
    }
    ll Q;
    cin >> Q;
    vector<ll> l(N);
    rep(i, N) { l[i] = L[i]; }
    sort(all(l));
    l.erase(unique(all(l)), l.end());
    map<ll, vector<ll>> mpl, mpa;
    rep(i, N - 1) {
        mpl[L[i + 1]].push_back(i + 1);
        mpa[A[i + 1]].push_back(i + 1);
    }
    vector<ll> ans(l.size());
    vector<ll> ans2(N, -1);
    vector<ll> used(N);
    ll t = 1;
    ans[0] = 1;
    used[0] = 1;
    rep(i, l.size()) {
        if (i == 0) continue;
        rep(j, mpl[l[i]].size()) {
            ll idx = mpl[l[i]][j];
            if (used[idx] == 1) continue;
            if (used[A[idx]] == 0) continue;
            used[idx] = 1;
            ans2[idx] = l[i];
            t++;
            rep(k, mpa[idx].size()) {
                ll jdx = mpa[idx][k];
                if (used[jdx]) continue;
                if (L[jdx] > l[i]) continue;
                used[jdx] = 1;
                ans2[jdx] = l[i];
                t++;
            }
        }
        ans[i] = t;
    }
    // cout << endl;
    // rep(i, l.size()) { cout << l[i] << " " << ans[i] << endl; }
    rep(i, Q) {
        ll t, x;
        cin >> t >> x;
        if (t == 1) {
            auto itr = upper_bound(all(l), x);
            --itr;
            cout << ans[distance(l.begin(), itr)] << endl;
        } else {
            x--;
            cout << ans2[x] << endl;
        }
    }
}