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 Control.Monad.ST
import qualified Data.ByteString.Char8 as C
import qualified Data.Vector as V
import qualified Data.Vector.Unboxed as U
import qualified Data.Vector.Unboxed.Mutable as UM

main = C.interact $ put . sol . get

get = U.unfoldr (C.readInt . C.dropWhile (<'0'))

put = C.unlines . fmap (C.pack . show) . U.toList

sol v = runST $ do
  h <- UM.replicate (10^5+1) 0
  U.forM_ as $ UM.unsafeModify h (+ 1)
  r <- UM.unsafeNew q
  let
    f s i bc = do
      let (b,c) = (bc U.! 0,bc U.! 1)
      cnt <- UM.unsafeRead h b
      UM.unsafeWrite h b 0
      UM.unsafeModify h (+ cnt) c
      UM.unsafeWrite r i (s+cnt*(c-b))
      return $ s+cnt*(c-b)
  V.ifoldM_ f (U.sum as) qs
  U.unsafeFreeze r
  where
  n = v U.! 0
  as = U.slice 1 n v
  q = v U.! (n+1)
  qs = V.unfoldrN q (Just . U.splitAt 2) $ U.unsafeDrop (n+2) v