#include <bits/stdc++.h>

#include <atcoder/all>
using ll = long long;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); ++i)
constexpr int inf = 2000'000'000;
constexpr ll linf = 4000000000000000000ll;
constexpr ll M7 = 1000000007ll;
constexpr ll M09 = 1000000009ll;
constexpr ll M9 = 998244353ll;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;
template <typename T>
inline ostream& operator<<(ostream& os, vector<T>& v) {
    for (auto& e : v) os << e << " ";
    return os;
}
template <typename T, typename U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) noexcept {
    return os << "(" << p.first << ", " << p.second << ")";
}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>
void debug_out(T t) {
    cerr << t << endl;
}
template <typename T, typename... Args>
void debug_out(T t, Args... args) {
    cerr << t << ", ";
    debug_out(args...);
}
#endif

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    struct edge {
        int to, cost;
        edge(int to, int cost) : to(to), cost(cost) {}
    };
    vector<vector<edge>> G(n);
    rep(i, n - 1) {
        int l, a;
        cin >> l >> a;
        G.at(a - 1).push_back(edge(i + 1, l));
    }
    vector<bool> seen(n);
    vector<int> a(n, -inf);
    auto dfs = [&](auto dfs, int u) -> void {
        seen.at(u) = true;
        for (const auto& e : G.at(u)) {
            if (seen.at(e.to))
                continue;
            a.at(e.to) = max(a.at(u), e.cost);
            dfs(dfs, e.to);
        }
    };
    a.at(0) = 0;
    dfs(dfs, 0);
    vector<int> sorted;
    rep(i, n) {
        if (a.at(i) != -inf)
            sorted.push_back(a.at(i));
    }
    sort(all(sorted));

    int q;
    cin >> q;
    rep(i, q) {
        int c, x;
        cin >> c >> x;
        if (c == 1) {
            auto ub = upper_bound(all(sorted), x);
            cout << (ub - sorted.begin()) << "\n";
        } else {
            if (a.at(x - 1) == -inf)
                cout << -1 << "\n";
            else
                cout << a.at(x - 1) << "\n";
        }
    }
    return 0;
}