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 JavaScript (Node.js 12.16.1) (judge verdict: Wrong Answer)

function Main(input) {
    input = input.trim().split("\n").map(function(x) { return x.split(" ")});
    var N = parseInt(input[0],10);
    var vec_A = input[1].map(e => parseInt(e, 10));
    var Q = parseInt(input[2], 10);
    ary_bc = [];
    for (var i = 0; i < Q; i++){
        ary_bc.push(input[i+3].map(e => parseInt(e, 10)));
    }
    var　ATable = vec_A.reduce(function(m, a, i) {
        m[a] = (m[a] || []).concat(i);
        return m;
        }, {});
    var b, c, l, strB, strC;
    var vec_S = [];
    var S = sum(vec_A);

    for (i = 0; i < Q; i++){
        l = 0;
        if (ary_bc[i][0] in ATable){
            l = 0;
            b = ary_bc[i][0];
            strB = String(b);
            c = ary_bc[i][1];
            strC = String(c);
          	// var tmp = ATable[String(b)]
            // if (tmp !== undefined)  l = tmp.length;
            l = ATable[strB].length;
            if (strC in ATable){
                ATable[strC] = ATable[strB].concat(ATable[strC]);
            } else {
                ATable[strC] = ATable[strB];
            }
            delete(ATable[strB]);
        }
        S = S + (c - b) * l
        vec_S.push(String(S));
    }
    console.log(vec_S.join('\n'));

}   

var sum  = function(arr) {
    var sum = 0;
    arr.forEach(function(elm) {
        sum += elm;
    });
    return sum;
};

Main(require("fs").readFileSync("/dev/stdin", "utf8"));