#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const queue<T> &x) {
  queue<T> temp = x;
  cerr << "\n-----\n";
  while (!temp.empty()) {
    cerr << temp.front() << endl;
    temp.pop();
  }
  cerr << "-----\n";
}
template <typename T>
void __print(const stack<T> &x) {
  stack<T> temp = x;
  cerr << "\n-----\n";
  while (!temp.empty()) {
    cerr << temp.top() << endl;
    temp.pop();
  }
  cerr << "-----\n";
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
using ll = long long;
const int N = 100005;
const int MOD = 1000000007;
int main() {
  ll i, n, k, sum = 0;
  scanf("%lld", &n);
  unordered_map<ll, ll> mp;
  for (i = 0; i < n; i++) {
    scanf("%lld", &k);
    sum += k;
    mp[k]++;
  }
  ll q, a, v;
  scanf("%lld", &q);
  while (q--) {
    scanf("%lld %lld", &a, &v);
    ll p = mp[a];
    if (p) {
      sum -= mp[a] * a;
      sum += p * v;
      mp[v] += p;
    }
    printf("%lld\n", sum);
  }
}
