{-# OPTIONS_GHC -O2 #-}
{-# LANGUAGE BangPatterns, BinaryLiterals, CPP, DerivingStrategies  #-}
{-# LANGUAGE DerivingVia, FlexibleContexts, FlexibleInstances       #-}
{-# LANGUAGE GeneralizedNewtypeDeriving, KindSignatures, LambdaCase #-}
{-# LANGUAGE MagicHash, MultiParamTypeClasses, MultiWayIf           #-}
{-# LANGUAGE NumericUnderscores, OverloadedStrings, PatternSynonyms #-}
{-# LANGUAGE RankNTypes, RecordWildCards, ScopedTypeVariables       #-}
{-# LANGUAGE StandaloneDeriving, TupleSections, TypeApplications    #-}
{-# LANGUAGE TypeFamilies, TypeInType, UnboxedTuples, ViewPatterns  #-}

import           Control.Applicative
import           Control.Exception
import           Control.Monad
import           Control.Monad.Primitive
import           Control.Monad.Reader
import           Control.Monad.ST
import           Control.Monad.State.Strict
import           Data.Bifunctor
import           Data.Bool
import qualified Data.ByteString               as B
import qualified Data.ByteString.Builder       as B
import qualified Data.ByteString.Char8         as C
import qualified Data.ByteString.Internal      as B
import qualified Data.ByteString.Unsafe        as B
import           Data.Char
import qualified Data.Foldable                 as F
import           Data.Function
import           Data.Functor.Identity
import qualified Data.IntMap.Strict            as IM
import qualified Data.IntSet                   as IS
import qualified Data.List                     as L
import qualified Data.Map.Strict               as M
import           Data.Monoid
import           Data.Ord
import           Data.Primitive
import           Data.Proxy
import           Data.Ratio
import           Data.Semigroup
import qualified Data.Set                      as S
import           Data.Tuple
import qualified Data.Vector                   as V
import qualified Data.Vector.Generic           as G
import qualified Data.Vector.Generic.Mutable   as GM
import qualified Data.Vector.Mutable           as VM
import qualified Data.Vector.Primitive         as P
import qualified Data.Vector.Primitive.Mutable as PM
import qualified Data.Vector.Unboxed           as U
import qualified Data.Vector.Unboxed.Mutable   as UM
import           Debug.Trace
import           Foreign                       hiding (void)
import           GHC.Exts
import           GHC.TypeLits
import qualified System.IO                     as IO
import           Unsafe.Coerce

#define MOD 1000000007

main :: IO ()
main = do
    n <- readLn :: IO Int
    (vws,qs) <- U.splitAt (2*n) . U.unfoldr (runParser int) <$> C.getContents
    let q = U.head qs
    putStr.unlines.map show.U.toList
        $ solve n (tuples2N n vws) q (tuples2N q $ U.tail qs)

inf :: Int
inf = 0x3f3f3f3f

solve :: Int -> U.Vector (Int, Int) -> Int -> U.Vector (Int, Int) -> U.Vector Int
solve n0 vws q qs
    | otherwise = U.map (uncurry query) qs
  where
    n = 0x40000
#ifdef DEBUG
    cacheSize = 4
#else
    cacheSize = 0x200
#endif
    wSize = 0x20000
    tr :: U.Vector (Int, Int)
    !tr = U.cons (0,inf) vws U.++ U.replicate (n - n0 - 1) (0, inf)

    ix :: Int -> Int -> Int
    ix i j = unsafeShiftL i 17 .|. j
    {-# INLINE ix #-}
    !table = U.create $ do
        dp <- UM.replicate (cacheSize * wSize) 0
        flip U.imapM_ (U.take cacheSize tr) $ \i (v, w) -> when (i > 0) $ do
            let !p = unsafeShiftRL i 1
            UM.unsafeCopy
                (UM.unsafeSlice (ix i 0) wSize dp)
                (UM.unsafeSlice (ix p 0) wSize dp)

            U.forM_ (U.generate (wSize - w) (+w)) $ \j -> do
                v' <- (+v) <$!> UM.unsafeRead dp (ix p (j - w))
                UM.unsafeModify dp (max v') (ix i j)
        return dp

    query v l
        | v < cacheSize = table U.! ix v l
        | otherwise =
            let !path = U.fromList . takeWhile (>= cacheSize) $ iterate (flip unsafeShiftRL 1) v
                !p = unsafeShiftRL (U.last path) 1
                !len = U.length path
            in F.foldl' max 0 $ do
                bits <- [0..shiftL @Int 1 len - 1]
                let (!value, !w) = F.foldl'(\acc i ->
                        if testBit bits i
                        then acc .+. (tr U.! (path U.! i))
                        else acc
                        )(0,0)[0..len - 1]
                guard $ w <= l
                return $! value + table U.! ix p (l - w)
    (x,y).+.(z,w) = (xz,yw)
      where
        !xz = x + z
        !yw = y + w


tuples2N :: Int -> U.Vector Int -> U.Vector (Int, Int)
tuples2N n = U.unfoldrN n $ \v ->
    let !x = U.unsafeIndex v 0
        !y = U.unsafeIndex v 1
    in Just ((x, y), U.unsafeDrop 2 v)

-------------------------------------------------------------------------------
-- Utils
-------------------------------------------------------------------------------
rep :: Monad m => Int -> (Int -> m ()) -> m ()
rep !n = U.forM_ $ U.generate n id
{-# INLINE rep #-}
rev :: Monad m => Int -> (Int -> m ()) -> m ()
rev !n = U.forM_ $ U.iterateN n (subtract 1) (n - 1)
{-# INLINE rev #-}
infixl 8 `shiftRL`, `unsafeShiftRL`
shiftRL = unsafeShiftRL
{-# INLINE shiftRL #-}
unsafeShiftRL (I# x#) (I# i#) = I# (uncheckedIShiftRL# x# i#)
{-# INLINE unsafeShiftRL #-}
type Parser a = StateT C.ByteString Maybe a
runParser :: Parser a -> C.ByteString -> Maybe (a, C.ByteString)
runParser = runStateT
{-# INLINE runParser #-}
int :: Parser Int
int = coerce $ C.readInt . C.dropWhile isSpace
{-# INLINE int #-}
int1 :: Parser Int
int1 = fmap (subtract 1) int
{-# INLINE int1 #-}
char :: Parser Char
char = coerce C.uncons
{-# INLINE char #-}
byte :: Parser Word8
byte = coerce B.uncons
{-# INLINE byte #-}

