Problem:
Score : 400 points

Problem Statement

You have a sequence A composed of N positive integers: A_{1}, A_{2}, \cdots, A_{N}.

You will now successively do the following Q operations:

In the i-th operation, you replace every element whose value is B_{i} with C_{i}.

For each i (1 \leq i \leq Q), find S_{i}: the sum of all elements in A just after the i-th operation.

Constraints

All values in input are integers.

1 \leq N, Q, A_{i}, B_{i}, C_{i} \leq 10^{5}

B_{i} \neq C_{i}

Input

Input is given from Standard Input in the following format:

N
A_{1} A_{2} \cdots A_{N}
Q
B_{1} C_{1}
B_{2} C_{2}
\vdots
B_{Q} C_{Q}

Output

Print Q integers S_{i} to Standard Output in the following format:

S_{1}
S_{2}
\vdots
S_{Q}

Note that S_{i} may not fit into a 32-bit integer.

Sample Input 1

4
1 2 3 4
3
1 2
3 4
2 4

Sample Output 1

11
12
16

Initially, the sequence A is 1,2,3,4.

After each operation, it becomes the following:

2, 2, 3, 4

2, 2, 4, 4

4, 4, 4, 4

Sample Input 2

4
1 1 1 1
3
1 2
2 1
3 5

Sample Output 2

8
4
4

Note that the sequence A may not contain an element whose value is B_{i}.

Sample Input 3

2
1 2
3
1 100
2 100
100 1000

Sample Output 3

102
200
2000

Solution in Haskell (GHC 8.8.3) (judge verdict: Accepted)

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 s'

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 0
  simulate bcs table s'
--  let as' = elemCountOnce as
--  let sumf = sum (map (\a -> (fst a) * (snd a)) as')
--  calcAll as' bcs sumf