# Original solution
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print((" ".join(ls)))
        elif type(ls[0])==int:
            print((" ".join(map(str,ls))))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print(("".join(ls)))
        elif type(ls[0])==int:
            print(("".join(map(str,ls))))
        else:
            print("Output Error")

def I():
    return int(eval(input()))

def MI():
    return list(map(int,input().split()))

def RI():
    return list(map(int,input().split()))

def CI(n):
    return [ int(eval(input())) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return eval(input())

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ eval(input()) for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

n = I()
a = RI()
q = I()
bc = LI(q)

for i in range(q):
    b = bc[i][0]
    c = bc[i][1]
    a = [ c if i==b else i for i in a ]
    s = sum(a)
    print(s)

# Optimized solution
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print((" ".join(ls)))
        elif type(ls[0])==int:
            print((" ".join(map(str,ls))))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print(("".join(ls)))
        elif type(ls[0])==int:
            print(("".join(map(str,ls))))
        else:
            print("Output Error")

def I():
    return int(eval(input()))

def MI():
    return list(map(int,input().split()))

def RI():
    return list(map(int,input().split()))

def CI(n):
    return [ int(eval(input())) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return eval(input())

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ eval(input()) for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

n = I()
a = RI()
q = I()
bc = LI(q)

s = sum(a)

d = defaultdict(int)
for i in range(n):
    d[ a[i] ] += 1
# print(d)   

for i in range(q):
    b = bc[i][0]
    c = bc[i][1]
    s += (c-b)*d[b]
    d[c] += d[b]
    d[b] = 0
    # print(d)
    print(s)