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++ (Clang 10.0.0) (judge verdict: Time Limit Exceeded)

#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>

using namespace std;
#define LOCAL
#define ff first
#define se second
#define all(a) begin(a), end(a)
#define mod 1e9 + 7
#define rep(i, n) for (int i = 0; i < )
typedef vector<int> VI;
typedef long long ll;

ll gcd(ll a, ll b) {
    a = abs(a), b = abs(b);
    while (b != 0) {
        a %= b;
        swap(a, b);
    }
    return a;
}

#ifdef LOCAL

void solve() {
    ll n;
    cin >> n;
    unordered_map<ll, ll> h;
    for (int i = 0; i < n; i++) {
        int t;
        cin >> t;
        h[t]++;
    }
    int q;
    cin >> q;
    while (q--) {
        int b, c;
        ll sum = 0;
        cin >> b >> c;
        if (h[b]) {
            int t = h[b];
            h.erase(b);
            h[c] += t;
        }
        // for (auto& [key, val] : h) {
        //     cout << key << "+" << val << endl;
        // }
        for (auto&[key, val] : h) {
            sum += val * key;
        }
        cout << sum << endl;
    }

}

int main() {
    solve();
    return 0;
}

#endif