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: Wrong Answer)

use std::io;
use std::collections::HashMap;

fn procon_read<T: std::str::FromStr>() ->  Vec<T> {
    let mut buf = String::new();
    io::stdin().read_line(&mut buf).expect("");
    let iter = buf.split_whitespace();
    let mut v: Vec<T> = Vec::new();
    for i in iter {
        v.push(i.parse().ok().unwrap());
    }
    v
}

fn main() {
    let mut map:HashMap<u64, u64> = HashMap::new();
    let n:u64 = procon_read()[0];
    let a:Vec<u64> = procon_read();
    let mut sum:u64 = 0;
    for i in a {
        match map.insert(i, 1) {
            Some(n) => {
                map.insert(i, n+1);
            },
            _ => (),
        }
        sum += i;
    }
    let q:u64 = procon_read()[0];
    let mut s:Vec<u64> = Vec::new();
    for i in 0..q {
        let bc:Vec<u64> = procon_read();
        match map.insert(bc[0], 1) {
            Some(n) => {
                for j in 0..n {
                    sum = sum - bc[0] + bc[1];
                }
                map.remove(&bc[0]);
                let m = match map.insert(bc[1], n) {
                    Some(n) => n,
                    None => 0,
                };
                map.insert(bc[1], m+n);
            },
            None => (),
        }
        s.push(sum);
    }
    for i in s {
        println!("{}", i);
    }
}