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 Microsoft.VisualBasic;
using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;

namespace AtCoder
{
	public class ABC
	{
		static public void Main(string[] args)
		{
			Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
			Solve(args);
			Console.Out.Flush();
		}

		private const int mod = 1000000007;  // 10^9+7

		static public void Solve(string[] args)
		{
			//string s = Console.ReadLine();
			//int n = int.Parse(Console.ReadLine());
			//long n = long.Parse(Console.ReadLine());
			//int[] a = Console.ReadLine().Split().Select(int.Parse).ToArray();
			//long[] vs = Console.ReadLine().Split().Select(long.Parse).ToArray();

			int n = int.Parse(Console.ReadLine());
			long[] vs = Console.ReadLine().Split().Select(long.Parse).ToArray();
			Dictionary<long, long> a = new Dictionary<long, long>();
			for (int i = 0; i < n; i++) {
				if (a.ContainsKey(vs[i])) {
					a[vs[i]]++;
				} else {
					a.Add(vs[i], 1);
				}
			}

			long ans = 0;
			foreach (var item in a) {
				//System.Diagnostics.Debug.WriteLine($"{item.Key} {item.Value}");
				ans += item.Key * item.Value;
			}

			int q = int.Parse(Console.ReadLine());
			for (int i = 0; i < q; i++) {
				vs = Console.ReadLine().Split().Select(long.Parse).ToArray();
				long b = vs[0];
				long c = vs[1];
				if (a.ContainsKey(b)) {
					ans += (c - b) * a[b];
					if (a.ContainsKey(c)) {
						a[c] += a[b];
					} else {
						a.Add(c, a[b]);
					}
					a.Remove(b);
				}
				Console.WriteLine(ans);
			}

		}
	}
}