#![allow(non_snake_case, unused_imports, unused_must_use)] use std::io::{self, prelude::*}; use std::str; fn main() { let (stdin, stdout) = (io::stdin(), io::stdout()); let mut scan = Scanner::new(stdin.lock()); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! input { ($T: ty) => { scan.token::<$T>() }; ($T: ty, $N: expr) => { (0..$N).map(|_| scan.token::<$T>()).collect::<Vec<_>>() }; } let N = input!(usize); let mut graph = vec![vec![]; N]; for i in 1..N { let l = input!(usize); let a = input!(usize) - 1; graph[a].push((i, l)); } let mut lower = vec![0; N]; let mut seen = vec![false; N]; let mut q = std::collections::VecDeque::new(); q.push_front(0); seen[0] = true; while let Some(now) = q.pop_front() { for &(nxt, l) in graph[now].iter() { lower[nxt] = std::cmp::max(lower[nxt], std::cmp::max(l, lower[now])); q.push_back(nxt); seen[nxt] = true; } } // eprintln!( // "{}", // lower // .iter() // .map(|x| x.to_string()) // .collect::<Vec<_>>() // .join(" ") // ); let lower_sorted = { let mut L = vec![]; for i in 0..N { if seen[i] { L.push(lower[i]); } } L.sort(); L }; let Q = input!(usize); for _ in 0..Q { let t = input!(usize); let x = input!(usize); if t == 1 { let mut ok = 0; let mut ng = lower_sorted.len(); while ng - ok > 1 { let m = (ok + ng) / 2; if lower_sorted[m] <= x { ok = m; } else { ng = m; } } writeln!(out, "{}", ok + 1); } else { if !seen[x - 1] { writeln!(out, "-1"); } else { writeln!(out, "{}", lower[x - 1]); } } } } struct Scanner<R> { reader: R, buf_str: Vec<u8>, buf_iter: str::SplitWhitespace<'static>, } impl<R: BufRead> Scanner<R> { fn new(reader: R) -> Self { Self { reader, buf_str: vec![], buf_iter: "".split_whitespace(), } } fn token<T: str::FromStr>(&mut self) -> T { loop { if let Some(token) = self.buf_iter.next() { return token.parse().ok().expect("Failed parse"); } self.buf_str.clear(); self.reader .read_until(b'\n', &mut self.buf_str) .expect("Failed read"); self.buf_iter = unsafe { let slice = str::from_utf8_unchecked(&self.buf_str); std::mem::transmute(slice.split_whitespace()) } } } }