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)

//
// ABC171D
// URL : https://atcoder.jp/contests/abc171/tasks/abc171_d
// 
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.IO.Pipes;

namespace AtCoder
{
    class ABC171D
    {
        static void Main(string[] args)
        {
            //出力高速化
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            Console.SetOut(sw);
            Solve();
            Console.Out.Flush();
        }
        public static void Solve()
        {
            var N = int.Parse(Console.ReadLine());
            var An = Console.ReadLine().Split(' ').Select(_inputStr => long.Parse(_inputStr)).ToArray();
            var Q = int.Parse(Console.ReadLine());

            //それぞれの要素が現れる数をカウント
            var countList = new long[100001];//1つ多めにして[0]を使わないでおくと、indexのずれをなくせる
            foreach(var a in An)
            {
                countList[a]++;
            }

            //前の総和から、入れ替えた場合の総和を求める
            var ans = An.Sum();
            for(int i = 0; i < Q; ++i) {
                var BC = Console.ReadLine().Split(' ').Select(_inputStr => long.Parse(_inputStr)).ToArray();
                long B = BC[0];
                long C = BC[1];
                //入れ替え前に値がBだった要素の数
                long BCountInPrev = countList[B];
                //総和を前回からの差分で計算
                ans += (C - B) * BCountInPrev;

                //要素の個数を更新
                //Bが全部Cになったので
                countList[C] += BCountInPrev;
                countList[B] = 0;//Bだったものはなくなった

                Console.WriteLine(ans);
            }
        }
    }
}