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: Time Limit Exceeded)

fn main() {
    let (n, a, t) = read();
    let ans = solve(n, a, t);
    //write(ans);
}
 
fn read() -> (i32, Vec<i32>, Vec<(i32, i32)>) {
    let mut l1 = String::new();
    std::io::stdin().read_line(&mut l1).ok();
    let n: i32 = l1.trim().parse().unwrap();
 
 
    let mut l1 = String::new();
    std::io::stdin().read_line(&mut l1).ok();
    let iter = l1.trim().split_whitespace();
    let mut a: Vec<i32> = Vec::new();
    for i in iter {
        a.push(i.parse().unwrap());
    }
 
    let mut l1 = String::new();
    std::io::stdin().read_line(&mut l1).ok();
    let q: i32 = l1.trim().parse().unwrap();
 
    let mut t: Vec<(i32, i32)> = Vec::new();
    for i in 0..q {
        let mut l1 = String::new();
        std::io::stdin().read_line(&mut l1).ok();
        let mut iter = l1.trim().split_whitespace();
        let b: i32 = iter.next().unwrap().parse().unwrap();
        let c: i32 = iter.next().unwrap().parse().unwrap();
 
        t.push((b, c));
    }
 
    (n, a, t)
}
 
fn write(s: i32) {
    println!("{}", s);
}
 
fn solve(n: i32, mut a: Vec<i32>, t: Vec<(i32, i32)>) {
    for (i, j) in t.iter() {
        a = a.iter().map(|&x| if x == *i {*j} else {x}).collect();
        println!("{}", a.iter().sum::<i32>());
    }
}