use std::cmp::Reverse;
use std::collections::VecDeque;

fn main() {
    let mut sc = Scanner::new();
    let t = 1;
    for _ in 0..t { solve(&mut sc); }
}

fn solve(sc:&mut Scanner) {
    let n = sc.usize();
    let la = (1..n).map(|_| (sc.usize(), sc.usize1())).collect::<Vec<_>>();

    let mut g = vec![vec![]; n];
    for (i, &(l, a)) in la.iter().enumerate() {
        g[a].push((i+1, l));
    }

    let dist = bfs(0, n, &g);

    let mut d = dist.iter().filter_map(|&x| x).collect::<Vec<_>>();
    d.sort();

    let q = sc.usize();
    for _ in 0..q {
        let t = sc.u8();
        match t {
            1 => {
                let x = sc.usize();
                let index = upper_bound(&d, x);
                println!("{}", index);
            }
            2 => {
                let y = sc.usize1();
                if let Some(dist) = dist[y] {
                    println!("{}", dist);
                } else {
                    println!("-1");
                }
            }
            _ => unreachable!()
        }
    }
}

fn upper_bound<T: Ord>(v: &Vec<T>, x: T) -> usize {
    let mut l = 0;
    let mut r = v.len();
    while l < r {
        let m = (l + r) / 2;
        if v[m] <= x {
            l = m + 1;
        } else {
            r = m;
        }
    }
    l
}

fn bfs(s:usize, n:usize, g:&Vec<Vec<(usize, usize)>>) -> Vec<Option<usize>> {
    let mut q = VecDeque::new(); q.push_back(s);
    let mut dist = vec![None; n];
    dist[s] = Some(0);

    while let Some(v) = q.pop_front() {
        for &(u, c) in g[v].iter() {
            if dist[u] >= dist[v].max(Some(c)) { continue }
            dist[u] = dist[v].max(Some(c));
            q.push_back(u);
        }
    }

    dist
}

struct Scanner { s : std::collections::VecDeque<String> } #[allow(unused)] impl Scanner { fn new() -> Self { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); Self { s : s.split_whitespace().map(|s| s.to_string()).collect() } } fn reload(&mut self) -> () { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); self.s = s.split_whitespace().map(|s| s.to_string()).collect(); } fn usize(&mut self) -> usize { self.input() } fn usize1(&mut self) -> usize { self.input::<usize>() - 1 } fn isize(&mut self) -> isize { self.input() } fn i32(&mut self) -> i32 { self.input() } fn i64(&mut self) -> i64 { self.input() } fn i128(&mut self) -> i128 { self.input() } fn u8(&mut self) -> u8 { self.input() } fn u32(&mut self) -> u32 { self.input() } fn u64(&mut self) -> u64 { self.input() } fn u128(&mut self) -> u128 { self.input() } fn edge(&mut self) -> (usize, usize) { (self.usize1(), self.usize1()) } fn edges(&mut self, m : usize) -> Vec<(usize, usize)> { let mut e = Vec::with_capacity(m); for _ in 0..m { e.push(self.edge()); } e } fn wedge<T:std::str::FromStr>(&mut self) -> (usize, usize, T) { (self.usize1(), self.usize1(), self.input()) } fn wedges<T:std::str::FromStr>(&mut self, m : usize) -> Vec<(usize, usize, T)> { let mut e = Vec::with_capacity(m); for _ in 0..m { e.push(self.wedge()); } e } fn input<T>(&mut self) -> T where T: std::str::FromStr { if self.s.is_empty() { self.reload(); } if let Some(head) = self.s.pop_front() { head.parse::<T>().ok().unwrap() } else { panic!() } } fn tuple<T, U>(&mut self) -> (T, U) where T: std::str::FromStr, U: std::str::FromStr { (self.input(), self.input()) } fn vec<T>(&mut self, n: usize) -> Vec<T> where T: std::str::FromStr { if self.s.is_empty() { self.reload(); } self.s.drain(..n).map(|s| s.parse::<T>().ok().unwrap() ).collect::<Vec<T>>() } fn nvec<T>(&mut self) -> Vec<T> where T: std::str::FromStr { let n : usize = self.input(); self.vec(n) } fn chars(&mut self) -> Vec<char> { let s : String = self.input(); s.chars().collect() } fn bytes(&mut self) -> Vec<u8> { let s : String = self.input(); s.bytes().collect() } }