Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

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

Sample Output 1

11
12
16

Initially, the sequence A is 1,2,3,4.

After each operation, it becomes the following:

2, 2, 3, 4

2, 2, 4, 4

4, 4, 4, 4

Sample Input 2

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

Sample Output 2

8
4
4

Note that the sequence A may not contain an element whose value is B_{i}.

Sample Input 3

2
1 2
3
1 100
2 100
100 1000

Sample Output 3

102
200
2000

Solution in Java (OpenJDK 11.0.6) (judge verdict: Accepted)


import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;

class Main {

	public static void main(String[] args)throws Exception {

		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String s=br.readLine().trim();
		int n=Integer.parseInt(s);

		String[] s1=br.readLine().split(" ");
		long sum=0;
		HashMap<Integer,Integer> hm=new HashMap<>();
		for(int i=0;i<n;i++)
		{
			int x=Integer.parseInt(s1[i].trim());
			sum+=x;
			if(hm.containsKey(x)) {
				hm.replace(x, hm.get(x)+1);
			}
			else {
				hm.put(x,1);
			}
			
		}


		String s3=br.readLine().trim();
		int q=Integer.parseInt(s3);
//		System.out.println(hm);
//		System.out.println(get_sum(segment,0,n-1,0,a.length-1,0));
		while(q-->0) {
			
			String[] s4=br.readLine().split(" ");
			int l=Integer.parseInt(s4[0].trim());
			int r=Integer.parseInt(s4[1].trim());
			
			if(hm.containsKey(l)) {
				int sum1=hm.get(l);
				if(hm.containsKey(r)) {
					hm.replace(r,sum1+hm.get(r));
				}
				else {
					hm.put(r,hm.get(l));
				}
				hm.remove(l);
				int diff=Math.abs(l-r);
				if(l>r)
				{
				sum-=(sum1*diff);	
				}
				else {
				sum+=(sum1*diff);	
				}
			}
//			System.out.println(hm);
//				
			System.out.println(sum);
			
			
		}
			
		
		
		
		
		
		
	}
}