Problem: There are N cards placed on a grid with H rows and W columns of squares.

The i-th card has an integer A_i written on it, and it is placed on the square at the R_i-th row from the top and the C_i-th column from the left.

Multiple cards may be placed on the same square.

You will first pick up at most one card from each row.

Then, you will pick up at most one card from each column.

Find the maximum possible sum of the integers written on the picked cards.

Constraints

* All values are integers.
* 1 \leq N \leq 10^5
* 1 \leq H, W \leq 10^5
* 1 \leq A_i \leq 10^5
* 1 \leq R_i \leq H
* 1 \leq C_i \leq W

Input

Input is given from Standard Input in the following format:


N H W
R_1 C_1 A_1
R_2 C_2 A_2
\vdots
R_N C_N A_N


Output

Print the maximum possible sum of the integers written on the picked cards.

Examples

Input

6 2 2
2 2 2
1 1 8
1 1 5
1 2 9
1 2 7
2 1 4


Output

28


Input

13 5 6
1 3 35902
4 6 19698
4 6 73389
3 6 3031
3 1 4771
1 4 4784
2 1 36357
2 1 24830
5 6 50219
4 6 22645
1 2 30739
1 4 68417
1 5 78537


Output

430590


Input

1 100000 100000
1 1 1


Output

1

Solution (in PYTHON3):

Solution:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


n,h,w = list(map(int, input().split()))
from collections import defaultdict
ns = defaultdict(list)
for i in range(n):
    r,c,a = list(map(int, input().split()))
    r -= 1; c -= 1
    c += h
    ns[r].append((a,c))
    ns[c].append((a,r))
class UnionFindTree:
    def __init__(self, n):
        self.n = n
        self.parent = list(range(n))
        self.size = [1] * n
        self.es = [0]*n

    def root(self, i):
        inter = set()
        while self.parent[i]!=i:
            inter.add(i)
            i = self.parent[i]
        r = i
        for i in inter:
            self.parent[i] = r
        return r

    def connect(self, i, j):
        ri = self.root(i)
        rj = self.root(j)
        if ri==rj:
            self.es[ri] += 1
            return
        if self.size[ri]<self.size[rj]:
            self.parent[ri] = rj
            self.size[rj] += self.size[ri]
            self.es[rj] += self.es[ri] + 1
        else:
            self.parent[rj] = ri
            self.size[ri] += self.size[rj]
            self.es[ri] += self.es[rj] + 1

def selectEdge(ns):
    """各頂点に1本以下の接続枝を割り当てて、重み最大化
    """
    from heapq import heappop as hpp, heappush as hp
    q = []
    for u in ns.keys():
        for a,v in ns[u]:
            if u<v:
                hp(q, (-a,(u,v)))
    # 辺を選択できる = 選択した場合の連結成分において頂点数>=枝数
    uf = UnionFindTree(h+w)
    ans = 0
    while q:
        a, (u,v) = hpp(q)
        a *= -1
        ru = uf.root(u)
        rv = uf.root(v)
        if ru==rv and uf.es[ru]<uf.size[ru]:
            uf.connect(u,v)
            ans += a
        elif ru!=rv and (uf.es[ru]+uf.es[rv]+1) <= (uf.size[ru]+uf.size[rv]):
            uf.connect(u,v)
            ans += a
    return ans,uf
ans,uf = selectEdge(ns)
print(ans)