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# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Collections.Generic;

class Program
{
	static void Main(string[] args)
	{
		int i;
		Dictionary<Int64, Int64> dict = new Dictionary<Int64, Int64>();

		int n = int.Parse(Console.ReadLine());
		string[] strInput = Console.ReadLine().Split(' ');

		Int64[] a = new Int64[n];
		for(i = 0; i < n; i++)
        {
			a[i] = Int64.Parse(strInput[i]);
			if(dict.ContainsKey(a[i]) == true)
            {
				dict[a[i]]++;
            }
			else
            {
				dict.Add(a[i], 1);
            }
		}
		int q = int.Parse(Console.ReadLine());
		Int64[] b = new Int64[q];
		Int64[] c = new Int64[q];
		for (i = 0; i < q; i++)
        {
			strInput = Console.ReadLine().Split(' ');
			b[i] = Int64.Parse(strInput[0]);
			c[i] = Int64.Parse(strInput[1]);
		}

		Int64 result = 0;
		Int64 tmpVal;

		//要素の和を最初に集計
		foreach (KeyValuePair<Int64, Int64> kvp in dict)
		{
			Int64 key = kvp.Key;
			Int64 val = kvp.Value;
			result += key * val;
		}

		for (i = 0; i < q; i++)
		{
			//操作
			if(dict.ContainsKey(b[i]) == true)
            {
				tmpVal = dict[b[i]];
				result -= tmpVal * b[i];
				result += tmpVal * c[i];
				if(dict.ContainsKey(c[i]) == true)
                {
					dict[c[i]] += tmpVal;
                }
                else
                {
					dict.Add(c[i], tmpVal);
                }
				dict.Remove(b[i]);
            }



			Console.WriteLine(result);
		}

		return;
	}
}