CF981B.Businessmen Problems

Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.

In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.

All elements are enumerated with integers. The ChemForces company has discovered $n$ distinct chemical elements with indices $a_1, a_2, \ldots, a_n$, and will get an income of $x_i$ Berland rubles if the $i$-th element from this list is in the set of this company.

The TopChemist company discovered $m$ distinct chemical elements with indices $b_1, b_2, \ldots, b_m$, and it will get an income of $y_j$ Berland rubles for including the $j$-th element from this list to its set.

In other words, the first company can present any subset of elements from ${a_1, a_2, \ldots, a_n}$ (possibly empty subset), the second company can present any subset of elements from ${b_1, b_2, \ldots, b_m}$ (possibly empty subset). There shouldn't be equal elements in the subsets.

Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.

两家著名的竞争公司 ChemForces 和 TopChemist 决定在展览上展示各自最近发现的化学元素集合。然而，他们知道：任何一种元素都不应同时出现在两家公司的集合中。

为避免这种情况，两家公司的代表决定就各自应展出的集合达成一项协议，使得两家公司的总收入最大化。

所有元素均用整数编号。ChemForces 公司发现了 $n$ 种互不相同的化学元素，其编号为 $a_1, a_2, \ldots, a_n$；若该公司在其展出集合中包含该列表中的第 $i$ 个元素，则可获得 $x_i$ 白俄罗斯卢布的收入。

TopChemist 公司发现了 $m$ 种互不相同的化学元素，其编号为 $b_1, b_2, \ldots, b_m$；若该公司在其展出集合中包含该列表中的第 $j$ 个元素，则可获得 $y_j$ 白俄罗斯卢布的收入。

换言之，第一家公司可从集合 $\{a_1, a_2, \ldots, a_n\}$ 中任选一个子集（可以为空集）进行展出；第二家公司可从集合 $\{b_1, b_2, \ldots, b_m\}$ 中任选一个子集（可以为空集）进行展出。但这两个子集不能包含相同的元素。

请帮助两家公司的代表选出满足“无公共元素”约束且总收入最大的两个集合。

The first line contains a single integer $n$ ($1 \leq n \leq 10^5$) — the number of elements discovered by ChemForces.

The $i$-th of the next $n$ lines contains two integers $a_i$ and $x_i$ ($1 \leq a_i \leq 10^9$, $1 \leq x_i \leq 10^9$) — the index of the $i$-th element and the income of its usage on the exhibition. It is guaranteed that all $a_i$ are distinct.

The next line contains a single integer $m$ ($1 \leq m \leq 10^5$) — the number of chemicals invented by TopChemist.

The $j$-th of the next $m$ lines contains two integers $b_j$ and $y_j$, ($1 \leq b_j \leq 10^9$, $1 \leq y_j \leq 10^9$) — the index of the $j$-th element and the income of its usage on the exhibition. It is guaranteed that all $b_j$ are distinct.

第一行包含一个整数 $n$（$1 \leq n \leq 10^5$）—— ChemForces 发现的元素个数。

接下来的 $n$ 行中，第 $i$ 行包含两个整数 $a_i$ 和 $x_i$（$1 \leq a_i \leq 10^9$，$1 \leq x_i \leq 10^9$）—— 分别表示第 $i$ 个元素的编号及其在展览中使用所带来的收益。保证所有 $a_i$ 互不相同。

下一行包含一个整数 $m$（$1 \leq m \leq 10^5$）—— TopChemist 发明的化学药品个数。

接下来的 $m$ 行中，第 $j$ 行包含两个整数 $b_j$ 和 $y_j$（$1 \leq b_j \leq 10^9$，$1 \leq y_j \leq 10^9$）—— 分别表示第 $j$ 种化学药品的编号及其在展览中使用所带来的收益。保证所有 $b_j$ 互不相同。

Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.

在确保两个集合不包含任何相同元素的前提下，选择两个公司的集合，输出所能获得的最大总收入。

In the first example ChemForces can choose the set ($3, 7$), while TopChemist can choose ($1, 2, 4$). This way the total income is $(10 + 2) + (4 + 4 + 4) = 24$.

In the second example ChemForces can choose the only element $10^9$, while TopChemist can choose ($14, 92, 35$). This way the total income is $(239) + (15 + 65 + 89) = 408$.

在第一个例子中，ChemForces 可以选择集合 $(3, 7)$，而 TopChemist 可以选择 $(1, 2, 4)$。此时总收入为 $(10 + 2) + (4 + 4 + 4) = 24$。

在第二个例子中，ChemForces 只能选择唯一元素 $10^9$，而 TopChemist 可以选择 $(14, 92, 35)$。此时总收入为 $(239) + (15 + 65 + 89) = 408$。