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.lang.*;

public class Main{
    public static void main(String[]args){
        Scanner sc = new Scanner(System.in);
        int N=sc.nextInt();
        int num[]=new int[100000];
        long S=0;
        int index=0;
        for(int i=0; i<N; i++){
            index=sc.nextInt()-1;
            num[index]++;
            S+=(index+1);
        }
        int Q=sc.nextInt();
        int B[]= new int[Q];
        int C[]= new int[Q];
        long s[]= new long[Q+1];
        s[0]=S;
        for(int i=0; i<Q; i++){
            B[i]= sc.nextInt();
            C[i]= sc.nextInt();
            if(num[B[i]-1]>0){
                s[i+1]= s[i]-(long)(num[B[i]-1]*(B[i]-C[i]));
                num[C[i]-1]+=num[B[i]-1];
                num[B[i]-1]=0;
            }else{
                s[i+1]=s[i];
            }
        }
        for(int i=1; i<Q+1; i++){
            System.out.println(s[i]);
        }
    }
}
