#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, INF = 1E9 + 7;
long double EPS = 1e-9;
inline long long add(long long x, long long y) {
  x += y;
  if (x >= 1000000007) x -= 1000000007;
  return x;
}
inline long long sub(long long x, long long y) {
  x -= y;
  if (x < 0) x += 1000000007;
  return x;
}
inline long long mul(long long x, long long y) {
  return (x % 1000000007 * 1ll * y % 1000000007) % 1000000007;
}
inline long long pwr(long long a, long long b) {
  long long x = 1 % 1000000007;
  while (b) {
    if (b & 1) x = mul(x, a);
    a = mul(a, a);
    b >>= 1;
  }
  return x % 1000000007;
}
inline long long inv(long long a) {
  return pwr(a, 1000000007 - 2) % 1000000007;
}
long long gcd(long long a, long long b) {
  if (!a) return b % 1000000007;
  return gcd(b % a, a) % 1000000007;
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
void solve() {
  long long n;
  cin >> n;
  map<long long, long long> m;
  vector<long long> v(n);
  for (auto& it : v) cin >> it;
  ;
  long long sum = 0;
  for (long long i = 0; i < n; i++) {
    m[v[i]]++;
    sum += v[i];
  }
  long long q;
  cin >> q;
  while (q--) {
    long long a, b;
    cin >> a >> b;
    sum -= m[a] * a;
    long long prev = m[b];
    m[b] += m[a];
    sum += (m[b] - prev) * b;
    cout << sum << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tc;
  tc = 1;
  while (tc--) {
    solve();
  }
}
