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;
using System.Linq;

namespace AtCoder0621
{
	class Program
	{
		static void Main(string[] args)
		{
			D();
		}

		static void D()
		{
			var n = int.Parse(Console.ReadLine());
			var a = Console.ReadLine().Split().Select(x => long.Parse(x)).ToArray();
			var q = int.Parse(Console.ReadLine());
			var bc = Enumerable.Range(0, q).Select(i => new IntPair(Console.ReadLine())).ToArray();
			long s0 = a.Sum();

			var m1 = a.Max();
			var m2 = bc.Max(x => Math.Max(x.First, x.Second));
			var m = Math.Max(m1, m2);

			var valueCounts = new long[m + 1];
			foreach (var val in a)
				valueCounts[val]++;

			for (int i = 0; i < q; i++)
			{
				var b = bc[i].First;
				var c = bc[i].Second;

				s0 = s0 + valueCounts[b] * (c - b);

				valueCounts[c] += valueCounts[b];
				valueCounts[b] = 0;

				Console.WriteLine(s0);
			}
		}

		static void C()
		{
			var n = long.Parse(Console.ReadLine());
			var cur = 26L;
			int chars = 1;
			while (n > cur)
			{
				n -= cur;
				cur *= 26L;
				chars++;
			}
			n -= 1;
			var l = new char[chars];
			chars--;
			while (chars >= 0)
			{
				l[chars--] = (char)('a' + n % 26);
				n /= 26;
			}

			Console.WriteLine(new string(l));
		}

		static void B()
		{
			var ints = Console.ReadLine().Split().Select(x => int.Parse(x)).ToArray();
			var k = ints[1];
			var a = Console.ReadLine().Split().Select(x => int.Parse(x)).ToArray();
			Array.Sort(a);

			Console.WriteLine(a.Take(k).Sum());
		}

		static void A()
		{
			var s = Console.ReadLine();
			if (s == s.ToLower())
				Console.WriteLine('a');
			else
				Console.WriteLine('A');
		}
	}

	public struct IntPair
	{
		public int First;
		public int Second;

		public IntPair(string s)
		{
			var split = s.Split();
			First = int.Parse(split[0]);
			Second = int.Parse(split[1]);
		}

		public IntPair(int first, int second)
		{
			First = first;
			Second = second;
		}

		public static bool operator ==(IntPair p1, IntPair p2) => p1.First == p2.First && p1.Second == p2.Second;
		public static bool operator !=(IntPair p1, IntPair p2) => p1.First != p2.First || p1.Second != p2.Second;
		public override string ToString() => $"{First} {Second}";
		public override bool Equals(object obj)
		{
			var p = obj as IntPair?;
			return p.HasValue && p.Value.First == First && p.Value.Second == Second;
		}

		public override int GetHashCode()
		{
			uint rol5 = ((uint)First << 5) | ((uint)First >> 27);
			return ((int)rol5 + First) ^ Second;
		}

		public static long UpperBound(long min, long max, Predicate<long> test)
		{
			long ans = min;
			long s = min;
			long e = max;
			while (s <= e)
			{
				long mid = (s + e) / 2;
				if (test(mid))
				{
					ans = mid;
					s = mid + 1;
				}
				else
					e = mid - 1;
			}

			return ans;
		}

		public static long LowerBound(long min, long max, Predicate<long> test)
		{
			long ans = max;
			long e = max;
			long s = min;

			while (s <= e)
			{
				long mid = (s + e) / 2;

				if (test(mid))
				{
					ans = mid;
					e = mid - 1;
				}
				else
					s = mid + 1;
			}

			return ans;
		}

	}

}