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.*;
import java.lang.*;
public class Main{
	public static void main(String[] args) throws Exception
	{

		Scanner sc=new Scanner(System.in);
		long t=sc.nextLong();
		
		List<Long> li=new ArrayList<Long>();
		List<Long> li1=new ArrayList<Long>();
		Map<Long,Long> mp=new HashMap<>();
		long sum=0;
		for(int i=0;i<t;i++)
		{
			 li.add(sc.nextLong());
			 sum=sum+li.get(i);
			 
		}
		
		map1(li,mp);
		long q=sc.nextLong();;
		for(int i=0;i<q;i++)
		{
			long b=sc.nextLong();
			long c=sc.nextLong();
			long x=0;
			long y=0;
			long z=0;
			if(mp.containsKey(b))
			{
			     x=mp.get(b);
			     y=b*x;
			     z=c*x;
			     sum=sum-y+z;
			     if(mp.containsKey(c))
			     {
			    	 mp.remove(b);
			    	 mp.put(c,mp.get(c)+x);
			     }
			     else
			     {
				mp.remove(b);
				mp.put(c,x);
			     }
			
			}
			li1.add(sum);
		}
		for(int i=0;i<li1.size();i++)
		{
			System.out.println(li1.get(i));
		}
		
	}
	public static void map1(List<Long> li,Map<Long,Long> mp)
	{
		for(int i=0;i<li.size();i++)
		{
			if(mp.containsKey(li.get(i)))
			{
				mp.put(li.get(i),mp.get(li.get(i))+1l);
			}
			else
			{
				mp.put(li.get(i),1l);
			}
		}

   }
}
