#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
void solve(long long N, std::vector<long long> A, long long Q,
           std::vector<long long> B, std::vector<long long> C) {
  map<ll, ll> mp;
  ll sum = 0;
  for (int i = 0; i < N; i++) {
    mp[A[i]]++;
    sum += A[i];
  }
  for (int i = 0; i < Q; i++) {
    sum -= B[i] * mp[B[i]];
    sum += C[i] * mp[B[i]];
    mp[C[i]] += mp[B[i]];
    cout << sum << "\n";
  }
}
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;
}
