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 C# (Mono-mcs 6.8.0.105) (judge verdict: Accepted)

using System;
using System.Collections.Generic;

public class Replacing{
       static int[]strToIntArr(String s){
//          s = s.Substring(1,s.Length-2);
	  string[] strArr = s.Split(new char[]{' '});
	  int len = strArr.Length;
          int[] retArr = new int[len];       
	  for(int i=0;i<len;i++){
	     string sVal = strArr[i];
	     int intVal = int.Parse(sVal);
	     retArr[i] = intVal;
	  }
          return retArr;
       }

  long[]getSums(int n, int q, int[]a, int[]b,int[]c){
      Dictionary<int,int>ctMap = initCtMap(n,a);
      long currS = getSum(n,a);
      long[]sArr = new long[q];
      for(int i=0;i<q;i++){
         if(ctMap.ContainsKey(b[i])){
	    long diff = c[i]-b[i];
	    long offset = diff*ctMap[b[i]];
	    currS += offset;
	    if(ctMap.ContainsKey(c[i])){
	       ctMap[c[i]] += ctMap[b[i]];
	    }else{
	       ctMap[c[i]] = ctMap[b[i]];	       
	    }
	    ctMap[b[i]] = 0;	    
	 }
	 sArr[i] = currS;
      }
      return sArr;
  }

  Dictionary<int,int>initCtMap(int n, int[]a){
  Dictionary<int,int>retD = new Dictionary<int,int>();
     for(int i=0;i<n;i++){
        int el = a[i];
        if(retD.ContainsKey(el)){
	   retD[el]++;
	}else retD[el] = 1;
     }
     return retD;
 }

  long getSum(int n, int[]a){
     long sum = 0L;
     for(int i=0;i<n;i++){
      sum += a[i];
    }
    return sum;
 }
  public static void Main(string[]args){
     string nLn,aLn,qLn;
     Replacing r = new Replacing();
     nLn = Console.ReadLine();
     aLn = Console.ReadLine();
     qLn = Console.ReadLine();
     int n = int.Parse(nLn);
     int q = int.Parse(qLn);
     int[]arr = strToIntArr(aLn);
     int[]b = new int[q];
     int[]c = new int[q];
     for(int i=0;i<q;i++){
        string bcLn = Console.ReadLine();
        int[] bcArr = strToIntArr(bcLn);
	b[i] = bcArr[0];
	c[i] = bcArr[1];
     }
     long[]s = r.getSums(n,q,arr,b,c);
      for(int i=0;i<q;i++){
         Console.WriteLine("{0}",s[i]);
      }
  }
}