#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 3e5 + 5;
int n, q, x, y, z;
ll ans;
char s[15];
map<ll, int> cnt;

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &x), ans += x, cnt[x]++;
    scanf("%d", &q);
    while (q--) {
        scanf("%s %d", &s, &x);
        if (s[0] == 'S') {
            scanf("%d", &y);
            if (x != y) {
                ans += 1LL * (y - x) * cnt[x];
                cnt[y] += cnt[x]; cnt[x] = 0;
            }
        }
        printf("%lld\n", ans);
    }
}