#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using dll = deque<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using usll = unordered_set<ll>;
using umll = unordered_map<ll, ll>;
using sll = stack<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
constexpr ll kMax = 1e12 + 1;
constexpr ll kMod = 1e9 + 7;
constexpr long double kPI = 3.14159265358979323846;
ll gcd(ll a, ll b) {
  if (a < b) {
    return gcd(b, a);
  }
  ll c = a % b;
  while (c != 0) {
    a = b;
    b = c;
    c = a % b;
  }
  return b;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void init() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}
int main() {
  init();
  ll N;
  cin >> N;
  umll A;
  ll acc = 0;
  for (ll(i) = (0); (i) < (N); (i)++) {
    ll a;
    cin >> a;
    if (A.find(a) != A.end()) {
      A[a]++;
    } else {
      A[a] = 1;
    }
    acc += a;
  }
  ll Q;
  cin >> Q;
  vll B(Q), C(Q);
  for (ll(i) = (0); (i) < (Q); (i)++) {
    cin >> B[i] >> C[i];
    if (A.find(B[i]) != A.end()) {
      ll diff = C[i] - B[i];
      ll sum = A[B[i]] * diff;
      cout << acc + sum << endl;
      if (A.find(C[i]) != A.end()) {
        A[C[i]] += A[B[i]];
        A[B[i]] = 0;
      }
      acc += sum;
    } else {
      cout << acc << endl;
    }
  }
  return 0;
}
