LazyReplacment

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. ### Input $N$ $A_{1}$ $A_{2}$ $\cdots$ $A_{N}$