You have a sequence A composed of N positive integers: A_{1}, A_{2}, \cdots, A_{N}.

You will now successively do the following Q operations:

* In the i-th operation, you replace every element whose value is B_{i} with C_{i}.



For each i (1 \leq i \leq Q), find S_{i}: the sum of all elements in A just after the i-th operation.

Constraints

* All values in input are integers.
* 1 \leq N, Q, A_{i}, B_{i}, C_{i} \leq 10^{5}
* B_{i} \neq C_{i}

Input

Input is given from Standard Input in the following format:


N
A_{1} A_{2} \cdots A_{N}
Q
B_{1} C_{1}
B_{2} C_{2}
\vdots
B_{Q} C_{Q}


Output

Print Q integers S_{i} to Standard Output in the following format:


S_{1}
S_{2}
\vdots
S_{Q}


Note that S_{i} may not fit into a 32-bit integer.

Examples

Input

4
1 2 3 4
3
1 2
3 4
2 4


Output

11
12
16


Input

4
1 1 1 1
3
1 2
2 1
3 5


Output

8
4
4


Input

2
1 2
3
1 100
2 100
100 1000


Output

102
200
2000
import java.util.*;
import java.io.PrintWriter;
import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.lang.Math.*;
import static java.lang.System.*;

public class Main {
	public static final int MOD = 1000000007;
	public static void main(String[] args) {
		int i,j;
		Scanner sc = new Scanner(in);
		int n = parseInt(sc.next());
		long[] a = new long[n];
		long sum=0;
		HashMap<Long, Integer> map = new HashMap<>();
		for (i = 0; i < n; i++) {
			a[i] = parseInt(sc.next());
			if(map.get(a[i])==null) {
				map.put(a[i], 1);
			} else {
				map.put(a[i], map.get(a[i])+1);
			}
			sum+=a[i];
		}
		int q = parseInt(sc.next());
		long[] b = new long[q];
		long[] c = new long[q];
		for (i = 0; i < q; i++) {
			b[i] = parseLong(sc.next());
			c[i] = parseLong(sc.next());
		}
		sc.close();
		PrintWriter pw = new PrintWriter(System.out);
		for(i = 0; i < q; i++) {
			if(map.get(b[i])!=null) {
				sum-=b[i]*map.get(b[i]);
				sum+=c[i]*map.get(b[i]);
				if(map.get(c[i])==null) {
					map.put(c[i], map.get(b[i]));
				} else {
					map.put(c[i], map.get(c[i])+map.get(b[i]));
				}
				map.put(b[i], map.get(0));
			}
			pw.println(sum);
		}
		pw.flush();
	}
}
