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.io.*;
import java.util.*;

public class Main
{
	static Scanner scan = new Scanner(System.in);
	public static void solve() throws Exception
	{
		//BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		//StringTokenizer tk = new StringTokenizer(in.readLine());
		int n = scan.nextInt();
		long[] nums = new long[n];
		long sum = 0;
		HashMap<Long,Long> map = new HashMap<>();
		for(int i=0;i<n;i++)
		{
			nums[i]=scan.nextLong();
			sum+=nums[i];
			if(map.containsKey(nums[i]))
			{
				map.replace(nums[i],map.get(nums[i])+1);
			}
			else
				map.put(nums[i],(long)1);
		}
		long q=scan.nextLong();
		while(q-->0)
		{
			long a = scan.nextLong();
			long b = scan.nextLong();
			if(map.get(a)==null)
				System.out.println(sum);
			else
			{
				long num = map.get(a);
				sum = sum+b*num-a*num;
				map.remove(a);
				if(map.containsKey(b))
				{
					map.replace(b,map.get(b)+num);
				}
				else
					map.put(b,num);
				System.out.println(sum);
			}
			//System.out.println(map);
		}
	}
	public static void main(String[] args) throws Exception
	{
		if(scan.hasNext())
		{
			//int t= scan.nextInt();
			int t= 1;
			while(t-->0)
			{	
				solve();
			}
		}
	}
}