import Control.Monad
import qualified Data.ByteString.Char8 as BS
import Data.List
import Data.Maybe
import qualified Data.Vector.Unboxed.Mutable as VUM

readInt = fst . fromJust . BS.readInt

readIntList = map readInt . BS.words

getInt = readInt <$> BS.getLine

getIntList = readIntList <$> BS.getLine

getIntNList n = map readIntList <$> replicateM (fromIntegral n) BS.getLine

--elemCountOnce :: Eq a => [a] -> [(a, Int)]
--elemCountOnce [] = []
--elemCountOnce (x : xs) = (x, (length $ filter (== x) xs) + 1) : elemCountOnce (filter (/= x) xs)
--
--calcAll as (bc : bcs) sumf = do
--  let b = head bc
--  let c = last bc
--  let sumf' = sumf + sum (map (\a -> (snd a) * (c - b)) (filter (\a -> fst a == b) as))
--  let as' = map (\a -> (if fst a == b then (c, snd a) else (fst a, snd a))) as
--  print sumf'
--  when (bcs /= []) $ calcAll as' bcs sumf'

--calc table i n s = do
--  p <- VUM.read table i
--  let s' = s + i * p
--  if i >= n
--    then return s'
--    else calc table (i+1) n s'

initial (a:as) table s = do
  let s' = s + a
  p <- VUM.read table a
  VUM.write table a (p + 1)
  if as == []
    then return s'
    else initial as table

simulate (bc:bcs) table s = do
  let b = head bc
  let c = last bc
  pb <- VUM.read table b
  VUM.write table b 0
  pc <- VUM.read table c
  VUM.write table c (pc + pb)
  let s' = s + pb * (c - b)
  print s'
  when (bcs /= []) $ simulate bcs table s'

main = do
  n <- getInt
  as <- getIntList
  q <- getInt
  bcs <- getIntNList q
  table <- VUM.replicate (10^5+1) 0 :: IO (VUM.IOVector Int)
  s' <- initial as table
  simulate bcs table s'
--  let as' = elemCountOnce as
--  let sumf = sum (map (\a -> (fst a) * (snd a)) as')
--  calcAll as' bcs sumf
