#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const long long int MOD = 1000000000 + 7;
struct UnionFind {
  vector<int> parent;
  UnionFind(int N) : parent(N) {
    for (int i = 0; i < N; i++) {
      parent[i] = -1;
    }
  }
  int root(int i) {
    if (parent[i] < 0) {
      return i;
    }
    return (parent[i] = root(parent[i]));
  }
  bool unite(int from, int to) {
    int rx = root(from);
    int ry = root(to);
    if (rx != ry) {
      parent[ry] += parent[rx];
      parent[rx] = ry;
      return true;
    } else {
      return false;
    }
  }
  bool same(int x, int y) { return root(x) == root(y); }
  int treeSize(int x) { return -parent[root(x)]; }
};
long long int modpow(long long int base, long long int pow, long long int mod) {
  if (pow == 1) {
    return base;
  } else if (pow == 0) {
    return 1;
  }
  if (pow % 2 == 0) {
    auto temp = modpow(base, pow / 2, mod);
    return (temp * temp) % mod;
  } else {
    return (base * modpow(base, pow - 1, mod)) % mod;
  }
}
long long int moddiv(long long int X, long long int Y, long long int mod) {
  auto fermatDiv = modpow(Y, mod - 2, mod);
  return (X * fermatDiv) % mod;
}
long long modCombination(long long left, long long right, long long int mod) {
  long long answer = 1;
  if (left > right) {
    for (long long i = 0; i < right; i++) {
      answer = (answer * (left - i)) % mod;
      answer = moddiv(answer, (i + 1), mod);
    }
  }
  return answer;
}
bool IsPrime(long long N) {
  if (N == 1) {
    return false;
  }
  for (long long i = 2; i * i <= N; i++) {
    if (N % i == 0) {
      return false;
    }
  }
  return true;
}
vector<pair<long long, long long>> prime_factorize(long long N) {
  vector<pair<long long, long long>> res;
  for (long long a = 2; a * a <= N; ++a) {
    if (N % a != 0) continue;
    long long ex = 0;
    while (N % a == 0) {
      ++ex;
      N /= a;
    }
    res.push_back({a, ex});
  }
  if (N != 1) res.push_back({N, 1});
  return res;
}
long long euclid(long long a, long long b) {
  if (a > b) {
    long long temp = b;
    b = a;
    a = temp;
  }
  if (b % a == 0) {
    return a;
  } else {
    return euclid(a, b - a);
  }
}
long long gcd(long long a, long long b) {
  if (b > a) {
    long long temp = b;
    b = a;
    a = temp;
  }
  long long c = a % b;
  if (c == 0) {
    return b;
  } else {
    return gcd(b, c);
  }
}
struct State {
  long long town;
  long long money;
  long long time;
  State(long long _town, long long _money, long long _time) {
    town = _town;
    money = _money;
    time = _time;
  }
  bool operator<(const State& s) const { return this->time > s.time; }
};
struct Edge {
  long long to, time, money;
  Edge(long long _to, long long _money, long long _time) {
    to = _to;
    time = _time;
    money = _money;
  }
};
int main() {
  int N, Q;
  cin >> N;
  vector<int> A(N);
  vector<int> values(100001);
  vector<vector<int>> indices(100001);
  for (int i = 0; i < N; i++) {
    int temp;
    cin >> temp;
    A[i] = temp;
  }
  for (int i = 0; i <= 100000; i++) {
    values[i] = i;
    indices[i] = vector<int>();
    indices[i].push_back(i);
  }
  cin >> Q;
  for (int i = 0; i < Q; i++) {
    int B, C;
    cin >> B >> C;
    for (auto index : indices[B]) {
      values[index] = C;
      indices[C].push_back(index);
    }
    indices[C].push_back(B);
    indices[B].clear();
    long long answer = 0;
    for (int j = 0; j < N; j++) {
      answer += values[A[j]];
    }
    cout << answer << endl;
  }
  return 0;
}
