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 C# (Mono-csc 3.5.0) (judge verdict: Runtime Error)

using System;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Security.Cryptography.X509Certificates;
using System.Text;
using System.Collections;
using System.Collections.Generic;
using static System.Console;
using static System.Math;
using System.Collections.Specialized;
using System.IO.Pipes;

namespace ConsoleC____
{
    class Program
    {
        static void Main()
        {
            int[] a = new int[10010];
            for (int i = 0; i < 10010; i++) a[i] = 0;
            int N = int.Parse(ReadLine());
            int[] A = new int[N];
            long ans = 0;
            string[] s = ReadLine().Split(' ');
            for (int i = 0; i < N; i++)
            {
                A[i] = int.Parse(s[i]);
                ans += A[i];
                //a[i]はiがA中に何個あるか記憶してる
                a[A[i]]++;
            }
            int Q = int.Parse(ReadLine());
            int[] B = new int[Q], C = new int[Q];
            for (int i = 0; i < 2 * Q; i += 2) {
                string[] s2 = ReadLine().Split(' ');
                B[i / 2] = int.Parse(s2[0]);
                C[i / 2] = int.Parse(s2[1]);
            }
            for (int i = 0; i < Q; i++)
            {
                //A中のB[i]の数を減らしてすべてC[i]として記録する
                int bNum = a[B[i]];
                //総和を書き換え
                //WriteLine("C[{0}]: {1}, B[{0}]: {2}, bNum: {3}", i, C[i], B[i], bNum);
                //for (int j = 0; j < N; j++) Write("{0} ", a[j + 1]);
                ans += (C[i] - B[i]) * bNum;
                WriteLine(ans);
                //a[i]の中身を書き換え
                a[B[i]] = 0;
                a[C[i]] += bNum;
            }
        }
    }
}