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++ (GCC 9.2.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;


void solve(long long N, std::vector<long long> A, long long Q, std::vector<long long> B, std::vector<long long> C){
  map<long long, long long> nums;
  long long acc = 0;
  for(long long i = 0; i < N; i++) {
    nums[A[i]]++;
    acc += A[i];
  }

  for(long long i = 0; i < Q; i++) {
    if(nums[B[i]] > 0) {
      cout << ((acc - B[i] * nums[B[i]]) + C[i] * nums[B[i]]) << endl;
      acc = ((acc - B[i] * nums[B[i]]) + C[i] * nums[B[i]]);
      nums[C[i]] += nums[B[i]];
      nums[B[i]] = 0;
    }
    else {
      cout << acc << endl;
    }
  }
}

// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
int main(){
    long long N;
  scanf("%lld",&N);
  std::vector<long long> A(N);
  for(int i = 0 ; i < N ; i++){
    scanf("%lld",&A[i]);
  }
  long long Q;
  scanf("%lld",&Q);
  std::vector<long long> B(Q);
  std::vector<long long> C(Q);
  for(int i = 0 ; i < Q ; i++){
    scanf("%lld",&B[i]);
    scanf("%lld",&C[i]);
  }
    solve(N, std::move(A), Q, std::move(B), std::move(C));
    return 0;
}