#include <stack>
#include <queue>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <set>
#include <tuple>
#include <cmath>
#include <random>
#include <algorithm>
#include <vector>
#include <iostream>
#include <fstream>
#include <chrono>
#include <numeric>

#define fio ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)
#define rng mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count())

#define ri(...) i64 __VA_ARGS__; rx(__VA_ARGS__)
#define rc(...) char __VA_ARGS__; rx(__VA_ARGS__)
#define rs(...) string __VA_ARGS__; rx(__VA_ARGS__)
#define rvi(x, n) vi x(n); cin >> x
#define rvvi(x, n, m) vvi x(n, vi(m)); cin >> x

#ifndef ONLINE_JUDGE
#define dbg(...) cerr << '[' << #__VA_ARGS__ << "]: "; dbg_log(__VA_ARGS__)
#else
#define dbg(...) ;;
#endif

#define fa(i, v) for (auto &i : v)
#define fi(i, n) for (i32 i = 0; i < n; i++)
#define fp(i, n) for (i32 i = 1; i < n; i++)
#define fr(i, n) for (i32 i = n - 1; i >= 0; i--)
#define fu(i) ri(_i); fi(i, _i)

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

typedef uint32_t u32;
typedef int32_t i32;
typedef uint64_t u64;
typedef int64_t i64;
#ifdef __SIZEOF_INT128__
typedef __uint128_t u128;
typedef __int128_t i128;
#endif
typedef vector<i64> vi;
typedef vector<vi> vvi;

template<typename T>
inline istream &operator>>(istream &in, vector<T> &v) {
    fa(x, v) in >> x;
    return in;
}

template<typename T>
inline ostream &operator<<(ostream &out, const vector<T> &v) {
    fa(x, v) out << x << ' ';
    return out;
}

template<typename T>
inline void rx(T &x) {
    cin >> x;
}

template<typename T, typename... R>
inline void rx(T &x, R &... l) {
    cin >> x;
    rx(l...);
}

template<typename T>
inline void dbg_log(const T &x) {
    cerr << x << '\n';
}

template<typename T, typename... R>
inline void dbg_log(const T &x, const R &... l) {
    cerr << x << ", ";
    dbg_log(l...);
}

template<typename T>
inline void wl(const T &x) {
    cout << x << '\n';
}

template<typename T, typename... R>
inline void wl(const T &x, const R &... l) {
    cout << x << ' ';
    wl<R...>(l...);
}

struct DSU {
    i32 n;
    vector<i32> lx;
    vector<i32> cnt;
    vector<i64> val;
    vector<i64> sm;
    i64 ttl;

    explicit DSU(vector<i64> &source) : n(source.size()),
                                        lx(n),
                                        cnt(n, 1),
                                        val(source),
                                        sm(source),
                                        ttl(0) {
        fi(i, n) lx[i] = i;
        fa(x, val) ttl += x;
    }

    i32 get(i32 i) {
        return lx[i] == i ? i : lx[i] = get(lx[i]);
    }

    void join(i32 i, i32 j) {
        i = get(i);
        j = get(j);
        if (cnt[j] > cnt[i]) swap(i, j);
        lx[j] = i;
        cnt[i] += cnt[j];

    }
};

int main() {
    fio;

    ri(n);
    vi cnt;
    unordered_map<i32, i32> lx;
    fi(i, n) {
        ri(x);
        if (lx.find(x) == lx.end()) {
            lx[x] = cnt.size();
            cnt.push_back(1);
        } else {
            cnt[lx[x]]++;
        }
    }
    i64 ttl = 0;
    for (auto[k, v] : lx) ttl += k * cnt[v];

    fu(q) {
        ri(x, y);
        if (lx.find(x) != lx.end()) {
            if (lx.find(y) != lx.end()) {
                ttl += cnt[lx[x]] * (y - x);
                cnt[lx[y]] += cnt[lx[x]];
                cnt[lx[x]] = 0;
            } else {
                ttl += cnt[lx[x]] * (y - x);
                lx[y] = cnt.size();
                cnt.push_back(cnt[lx[x]]);
                cnt[lx[x]] = 0;
            }
        }
        wl(ttl);
    }

    return 0;
}


Measured memory_bytes: 7420