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 Ruby (2.7.1) (judge verdict: Accepted)

def main(str)
  lines = str.split("\n")
  _n = lines[0].to_i
  as = lines[1].split(" ").map(&:to_i)
  _q = lines[2].to_i
  bcs = lines[3..-1].map { |x| x.split(" ").map(&:to_i) }
  ahash = as.each_with_object(Hash.new(0)) { |x, m| m[x] += 1 }
  asum = ahash.map { |k, v| k * v }.sum
  ans = bcs.map do |b, c|
    val = ahash[b] || 0
    ahash[c] += val
    ahash[b] = 0
    asum += (c - b) * val
  end
  ans.map(&:to_s).join("\n")
end

unless ENV["TEST"]
  puts(main($stdin.read.chomp))
  exit(0)
end

require 'minitest/autorun'

class TestA < Minitest::Test
  def test_main
    assert_equal("11
12
16", main("4
1 2 3 4
3
1 2
3 4
2 4"))
    assert_equal("8
4
4", main("4
1 1 1 1
3
1 2
2 1
3 5"))

    assert_equal("102
200
2000", main("2
1 2
3
1 100
2 100
100 1000"))
  end
end