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 Kotlin (1.3.71) (judge verdict: Wrong Answer)

import java.util.*

fun main(args: Array<String>) {
    val sc = Scanner(System.`in`)
    val n = sc.nextInt()
    val a = (0 until n).map { sc.next().toInt() }
    val q = sc.nextInt()
    val bc = (0 until q).map { sc.next().toInt() to sc.next().toInt() }
    println(problem171d(n, a, q, bc))
}

fun problem171d(
    n: Int,
    a: List<Int>,
    q: Int,
    bc: List<Pair<Int, Int>>
): String {
    val ans = mutableListOf<Long>()
    var sum = 0L
    for (i in 0 until n) {
        sum += a[i]
    }
    ans.add(sum)
    val counts = mutableMapOf<Int, Int>()
    for (i in 0 until n) {
        val ai = a[i]
        if (counts[ai] == null) {
            counts[ai] = 0
        }
        counts[ai] = counts[ai]!!.plus(1)
    }
   for (i in 0 until q) {
       val (b, c) = bc[i]
       if (counts[b] == null) {
           ans.add(ans.last())
           continue
       }
       val bC = counts[b]!!
       val cC = counts[c]
       counts[c] = (cC ?: 0) + bC
       counts[b] = 0
       var s = 0L
       for (j in counts) {
           s += j.key * j.value
       }
       ans.add(s)
   }
    return ans.drop(1).joinToString("\n")
}