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 Rust (1.42.0) (judge verdict: Accepted)

use proconio::input;
use std::collections::HashMap;

mod X{
    pub struct UnionFind {
        n: usize,
        par: Vec<usize>,
        rank: Vec<usize>,
        sz: Vec<usize>,
    }

    impl UnionFind {

        pub fn new(n:usize) -> UnionFind {
            UnionFind{
                n:n,
                par:(0..n).map(|i|i).collect(),
                rank:vec![0;n],
                sz:vec![1;n],
            }
        }

        pub fn size(&self) -> usize {self.n}

        pub fn size_of(&mut self,v:usize) -> usize { 
            let v = self.find(v);
            self.sz[v]
        }
        pub fn find(&mut self,v:usize) -> usize {
            if self.par[v] == v {
                v
            }
            else {
                let p = self.find(self.par[v]);
                self.par[v] = p;
                p
            }
        }


        pub fn unite(&mut self,a:usize,b:usize){
            let a = self.find(a);
            let b = self.find(b);
            if a==b {
                return
            }
            else {
                if self.rank[a]<self.rank[b] {
                    self.sz[b]+=self.sz[a];
                    self.par[a] = b;
                }
                else {
                    if self.rank[a]==self.rank[b] {
                        self.rank[a] += 1;
                    }
                    self.sz[a]+=self.sz[b];
                    self.par[b] = a;
                }
            }
        }

        pub fn is_same(&mut self,a:usize,b:usize) -> bool {
            self.find(a)==self.find(b)
        }

    }
}

use X::UnionFind;

fn main() {
    input!{
        n:usize,
        a:[i64;n],
        q:usize,
        bc:[(i64,i64);q]
    };

    let mut uf = UnionFind::new(n);
    let mut mp:HashMap<i64,usize> = HashMap::new();

    for (i,x) in a.iter().enumerate() {
        if mp.contains_key(x) {
            uf.unite(i,mp[x]);
        }
        else {
            mp.insert(*x,i);
        }
    }

    let mut sum:i64 = a.iter().sum();

    for (b,c) in bc {
        if !mp.contains_key(&b) {
            println!("{}",sum);
            continue;
        }

        let vb = mp[&b];
        sum -= (uf.size_of(vb) as i64)*b;
        if mp.contains_key(&c) {
            let vc = mp[&c];
            if !uf.is_same(vb,vc) {
                sum-=(uf.size_of(vc) as i64)*c;
                uf.unite(vb,vc);
            }
        }
        mp.remove(&b);
        mp.insert(c,vb);
        sum+=(uf.size_of(vb) as i64)*c;
        println!("{}",sum);
    }

    
}