#include <bits/stdc++.h>
using namespace std;
template <unsigned int MD>
struct ModInt {
  using M = ModInt;
  const static M G;
  unsigned int v;
  ModInt(long long _v = 0) { set_v(unsigned int(_v % MD + MD)); }
  M& set_v(unsigned int _v) {
    v = (_v < MD) ? _v : _v - MD;
    return *this;
  }
  explicit operator bool() const { return v != 0; }
  M operator-() const { return M() - *this; }
  M operator+(const M& r) const { return M().set_v(v + r.v); }
  M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
  M operator*(const M& r) const {
    return M().set_v(unsigned int(unsigned long long(v) * r.v % MD));
  }
  M operator/(const M& r) const { return *this * r.inv(); }
  M& operator+=(const M& r) { return *this = *this + r; }
  M& operator-=(const M& r) { return *this = *this - r; }
  M& operator*=(const M& r) { return *this = *this * r; }
  M& operator/=(const M& r) { return *this = *this / r; }
  bool operator==(const M& r) const { return v == r.v; }
  M pow(long long n) const {
    M x = *this, r = 1;
    while (n) {
      if (n & 1) r *= x;
      x *= x;
      n >>= 1;
    }
    return r;
  }
  M inv() const { return pow(MD - 2); }
  friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};
using Mint = ModInt<1000000007>;
const double PI = 3.14159265358979323846;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
  if (a.second != b.second) {
    return a.second < b.second;
  } else {
    return a.first < b.first;
  }
}
long long gcd(long long a, long long b) { return b != 0 ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
int main() {
  long long n, q;
  cin >> n;
  map<long long, long long> mp;
  for (long long(i) = 0; (i) < (n); (i)++) {
    long long a;
    cin >> a;
    mp[a]++;
  }
  cin >> q;
  for (long long(i) = 0; (i) < (q); (i)++) {
    long long b, c;
    cin >> b >> c;
    long long sum = 0;
    long long tmp = mp[b];
    mp[b] = 0;
    mp[c] += tmp;
    for (auto p : mp) sum += p.first * p.second;
    cout << sum << endl;
  }
}
