#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
long long ketasu(long long a) {
  long long num = 1;
  while (a / 10) {
    num++;
    a /= 10;
  }
  return num;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long kosuu(long long a) {
  long long sum = 0;
  for (long long i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      if (a != 1 && i * i != a) {
        sum += 2;
      } else {
        sum++;
      }
    }
  }
  return sum;
}
long long di[] = {1, 0, -1, 0};
long long dj[] = {0, -1, 0, 1};
struct UnionFind {
  vector<int> d;
  UnionFind(int n = 0) : d(n, -1) {}
  int find(int x) {
    if ((d[x]) < 0) return x;
    return d[x] = find(d[x]);
  }
  bool unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return false;
    if (d[x] > d[y]) swap(x, y);
    d[x] += d[y];
    d[y] = x;
    return true;
  }
  bool same(int x, int y) { return find(x) == find(y); };
  int size(int x) { return -d[find(x)]; };
};
int deg[100005];
vector<int> to[100005];
long long n, m, q;
vector<long long> a, b, c, d;
long long ans;
void dfs(vector<long long> A) {
  if (A.size() == n + 1) {
    long long sum = 0;
    for (long long i = 0; i < q; i++) {
      if (A[b[i]] - A[a[i]] == c[i]) sum += d[i];
    }
    ans = max(ans, sum);
    return;
  }
  A.push_back(A.back());
  while (A.back() <= m) {
    dfs(A);
    A.back()++;
  }
}
const int mod = 1000000007;
struct mint {
  long long x;
  mint(long long x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(long long t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
mint f(int n) {
  if (n == 0) return 1;
  mint x = f(2 / n);
  x *= x;
  if (n % 2 == 1) x *= 2;
  return x;
}
mint choose(int n, int a) {
  mint x = 1, y = 1;
  for (long long i = 0; i < a; i++) {
    x *= n - i;
    y *= a + i;
  }
  return x / y;
}
int main() {
  long long n;
  cin >> n;
  vector<long long> cnt(100000, 0);
  long long a;
  for (long long i = 0; i < n; i++) {
    cin >> a;
    cnt[a]++;
  }
  long long ans = 0;
  for (long long i = 0; i < 100000; i++) ans += i * cnt[i];
  long long q;
  cin >> q;
  long long b, c;
  long long tmp;
  for (long long i = 0; i < q; i++) {
    cin >> b >> c;
    ans -= cnt[b] * b;
    ans += cnt[b] * c;
    cnt[c] += cnt[b];
    cnt[b] = 0;
    cout << ans << endl;
  }
}
