#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
struct io {
  io() {
    ios::sync_with_stdio(false);
    cin.tie(0);
  }
};
const int INF = INT_MAX;
const long long int LLINF = 1LL << 60;
const long long int MOD = 1000000007;
const double EPS = 1e-9;
signed main() {
  long long int r = 0;
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  for (int i = 0; i < (n); ++i) cin >> a[i];
  long long int q;
  cin >> q;
  vector<long long int> b(n), c(n);
  for (int i = 0; i < (q); ++i) {
    cin >> b[i] >> c[i];
    for (int j = 0; j < (n); ++j) {
      if (a[j] == b[i]) {
        a[j] = c[i];
      }
      r += a[j];
    }
    cout << r << endl;
    r = 0;
  }
  return 0;
}
