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 std::io::stdin;

#[derive(Debug)]
pub struct SegTree {
    size: usize,
    sum: Vec<i64>,
}

impl SegTree {
    pub fn new(n: i64) -> Self {
        let mut size = 1;
        while size <= n {
            size *= 2;
        }
        return SegTree {
            size: size as usize,
            sum: vec![0; (size * 2) as usize],
        };
    }
    pub fn update(self: &mut Self, i: usize, x: i64) {
        let mut i = self.size + i - 1;
        self.sum[i] = x;
        while i > 0 {
            i = (i - 1) / 2;
            self.sum[i] = self.sum[2 * i + 1] + self.sum[2 * i + 2];
        }
    }
    pub fn total(self: &mut Self) -> i64 {
        return self.sum[0];
    }
}

#[test]
fn segtree_test() {
    let mut t = SegTree::new(10);
    assert_eq!(t.size, 16);
    assert_eq!(t.total(), 0);
    println!("{:?}", t);
    for x in 0..10 {
        t.update(x, 1);
    }
    println!("{:?}", t);
    assert_eq!(t.total(), 10);
    t.update(1, 200);
    assert_eq!(t.total(), 209);
    t.update(2, 200);
    assert_eq!(t.total(), 408);
}

fn main() {
    let n: i64 = {
        let mut buf = String::new();
        stdin().read_line(&mut buf).unwrap();
        buf.split_whitespace().next().unwrap().parse().unwrap()
    };
    let a : Vec<_>= {
        let mut buf = String::new();
        stdin().read_line(&mut buf).unwrap();
        buf.split_whitespace().filter_map(|x| x.parse::<i64>().ok()).collect()
    };
    let mut segtree = SegTree::new(100001);
    let mut count = vec![0; 100001];
    for x in a {
        count[x as usize] += 1;

        segtree.update(x as usize, count[x as usize] * (x as i64));
    }

    let q: i64 = {
        let mut buf = String::new();
        stdin().read_line(&mut buf).unwrap();
        buf.split_whitespace().next().unwrap().parse().unwrap()
    };


    for _ in 0..q {
        let chars : Vec<_>= {
            let mut buf = String::new();
            stdin().read_line(&mut buf).unwrap();
            buf.split_whitespace()
                .filter_map(|x| x.parse::<usize>().ok())
                .collect()
        };
        if let &[b, c,..] = chars.as_slice()
        {
            count[c] += count[b];
            count[b] = 0;
            segtree.update(c as usize, count[c] * (c as i64));
            segtree.update(b as usize, 0);
            println!("{}", segtree.total());
        }
    }
}