#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INF = 100005;
long long int mod = 1000000007;
long long TES = 1000007;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
void solve() {
  long long n, sum = 0;
  cin >> n;
  int make_pair[100005];
  for (int(i) = (0); (i) < (n); ++(i)) {
    int temp;
    cin >> temp;
    sum += temp;
    make_pair[temp]++;
  }
  long long query;
  cin >> query;
  long long res[query];
  for (int(i) = (0); (i) < (query); ++(i)) {
    long long a, b;
    cin >> a >> b;
    sum += (b - a) * make_pair[a];
    make_pair[b] += make_pair[a];
    make_pair[a] = 0;
    cout << sum << endl;
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  solve();
  return 0;
}
