{"raw_statement":[{"iden":"problem statement","content":"You have a sequence $A$ composed of $N$ positive integers: $A_{1}, A_{2}, \\cdots, A_{N}$.\nYou will now successively do the following $Q$ operations:\n\n*   In the $i$\\-th operation, you replace every element whose value is $B_{i}$ with $C_{i}$.\n\nFor each $i$ $(1 \\leq i \\leq Q)$, find $S_{i}$: the sum of all elements in $A$ just after the $i$\\-th operation."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N, Q, A_{i}, B_{i}, C_{i} \\leq 10^{5}$\n*   $B_{i} \\neq C_{i}$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_{1}$ $A_{2}$ $\\cdots$ $A_{N}$\n$Q$\n$B_{1}$ $C_{1}$\n$B_{2}$ $C_{2}$\n$\\vdots$\n$B_{Q}$ $C_{Q}$"},{"iden":"sample input 1","content":"4\n1 2 3 4\n3\n1 2\n3 4\n2 4"},{"iden":"sample output 1","content":"11\n12\n16\n\nInitially, the sequence $A$ is $1,2,3,4$.\nAfter each operation, it becomes the following:\n\n*   $2, 2, 3, 4$\n*   $2, 2, 4, 4$\n*   $4, 4, 4, 4$"},{"iden":"sample input 2","content":"4\n1 1 1 1\n3\n1 2\n2 1\n3 5"},{"iden":"sample output 2","content":"8\n4\n4\n\nNote that the sequence $A$ may not contain an element whose value is $B_{i}$."},{"iden":"sample input 3","content":"2\n1 2\n3\n1 100\n2 100\n100 1000"},{"iden":"sample output 3","content":"102\n200\n2000"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}