#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T S(T a) {
  return a * a;
}
template <class T>
inline string tostring(T a) {
  ostringstream os("");
  os << a;
  return os.str();
}
template <typename T>
inline long long tolong(T a) {
  long long res;
  istringstream os(a);
  os >> res;
  return res;
}
template <typename T>
inline T gcd(T a, T b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
template <typename T>
inline T bigmod(T a, T b, T m) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return S(bigmod(a, b / 2, m)) % m;
  else
    return (a % m * bigmod(a, b - 1, m)) % m;
}
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e16 + 5;
const long long modd = (long long)1e9 + 7;
const int mod = 10000007;
void pr(int f) {
  if (f == 1)
    cout << "YES\n";
  else
    cout << "NO\n";
}
bool isprime(long long n) {
  if (n < 2) return 0;
  if (n == 2)
    return 1;
  else {
    for (int i = 2; i * i <= n; i++)
      if (n % i == 0) return 0;
  }
  return 1;
}
map<int, int> mp;
set<int> st;
multiset<string>::iterator it;
deque<char> q;
int vis[10000000];
pair<int, int> a[2020];
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  int ar[n + 1];
  map<int, int> m;
  int c = 0;
  for (int i = 1; i <= n; i++) {
    cin >> ar[i];
    c += ar[i];
    m[ar[i]]++;
  }
  int t;
  cin >> t;
  while (t--) {
    int a, b;
    cin >> a >> b;
    c -= m[a] * a;
    c += m[a] * b;
    m[a] = 0;
    cout << c << endl;
  }
}
