#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(solve)?
        .join()
        .unwrap();
    Ok(())
}

fn solve() {
    let stdin = io::stdin();
    let mut kin = KInput::new(stdin.lock());
    let stdout = io::stdout();
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } }
    }
    
    let n: usize = kin.input();
    let mut vw: Vec<(usize, usize)> = kin.seq(n);
    vw.insert(0, (0, 0));
    let q: usize = kin.input();
    let mut qs = vec![Vec::new(); n + 1];
    for (i, (v, l)) in kin.iter::<(usize, usize)>().take(q).enumerate() {
        qs[v].push((i, l));
    }

    let mut res = vec![0; q];
    let mut dpu = Map::new();
    dpu.insert(0, 0);
    let mut dpd = Map::new();
    dpd.insert(0, 0);
    dfs(&vw, 1, 0, &qs, &mut res, &dpu, &dpd);
    for v in res {
        outputln!("{}", v);
    }
}

type Map = BTreeMap<usize, usize>;
const M: usize = 100000;
pub fn dfs(vw: &[(usize, usize)], u: usize, d: usize, qs: &[Vec<(usize, usize)>], res: &mut [usize], dpu: &Map, dpd: &Map) {
    if u >= vw.len() {
        return;
    }
    let (vu, wu) = vw[u];
    let mut dpu_next  = dpu.clone();
    for (&k, &v) in dpu.iter().rev() {
        if k + wu <= M {
            let e = dpu_next.entry(k + wu).or_insert(v + vu);
            *e = (*e).max(v + vu);
        }
    }
    let mut max = 0;
    for (&k, v) in dpu_next.iter_mut() {
        if k > 0 {
            *v = (*v).max(max);
            max = max.max(*v);
        }
    }
    // eprintln!("[{}]\n{:?}\n{:?}", u, &dpu_next, dpd);
    for &(i, l) in &qs[u] {
        let mut ans = 0;
        for (&k, &v) in dpu_next.range(..=l) {
            if let Some((_, &vd)) = dpd.range(..=l - k).last() {
                ans = ans.max(v + vd);
            }
        }
        res[i] = ans;
    }
    if d != 11 {
        dfs(vw, 2 * u, d + 1, qs, res, &dpu_next, dpd);
        dfs(vw, 2 * u + 1, d + 1, qs, res, &dpu_next, dpd);
    } else {
        dfs(vw, 2 * u, d + 1, qs, res, dpd, &dpu_next);
        dfs(vw, 2 * u + 1, d + 1, qs, res, dpd, &dpu_next);
    }
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::io::prelude::*;
    pub trait Input {
        fn str(&mut self) -> &str;
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
        pub fn src(&mut self) -> &mut R {
            &mut self.src
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.str().as_bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().expect("parse error")
                }
            })*
        }
    }
    from_str_impl! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}


Measured memory_bytes: 15560