#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const double PI = acos(-1.0);
const double epsilon = PI / 180.0;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 1e5 + 10;
int num[N], a[N];
int main() {
  int n;
  cin >> n;
  long long sum = 0;
  for (int i = 1; i < n + 1; i++) scanf("%d", &a[i]), num[a[i]]++, sum += a[i];
  int q;
  cin >> q;
  while (q--) {
    int b, c;
    scanf("%d %d", &b, &c);
    sum -= b * num[b];
    sum += c * num[b];
    num[c] += num[b];
    num[b] = 0;
    cout << sum << "\n";
  }
  return 0;
}
