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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
struct uf{
	int par[200005],ran[200005],sum[200005];
	void init(){
		rep(i,200005) { par[i] = i,ran[i] = 0,sum[i] = 0; }
	}
	int find(int x){
		if(x == par[x]) return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x,int y){
		x = find(x); y = find(y);
		if(x == y) return;
		if(ran[x] < ran[y]){
			par[x] = y;
			sum[y] += sum[x];
		}
		else{
			par[y] = x;
			sum[x] += sum[y];
		}
	}
}kaede;
int n,h,w;
vector<P1>vec;
int main(){
	scanf("%d%d%d",&n,&h,&w);
	for(int i=1;i<=n;i++){
		int r,c,a; scanf("%d%d%d",&r,&c,&a);
		vec.pb(mp(-a,mp(r,100000+c)));
	}
	SORT(vec);
	ll ans = 0;
	kaede.init();
	for(int i=0;i<vec.size();i++){
		int x = vec[i].sc.fi , y = vec[i].sc.sc;
		if(kaede.find(x) != kaede.find(y)){
		    if(kaede.sum[kaede.find(x)] + kaede.sum[kaede.find(y)] <= 1){
    			kaede.unite(x,y);
    			ans -= vec[i].fi;
		    }
		}
		else if(kaede.sum[kaede.find(x)] == 0){
			kaede.sum[kaede.find(x)]++;
			ans -= vec[i].fi;
		}
	}
	cout << ans << endl;
}