#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <random>
#include <tuple>
#include <iomanip>
#include <cstring>

using namespace std;

typedef long long ll;
//typedef pair<int,int> Pint;
//typedef pair<ll, ll> P;
//typedef pair<ll, pair<ll, ll>> P;
//typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n-1); i >= 0; i--)
#define pb push_back
#define f first
#define s second
//const ll INFL = 1LL << 60;//10^18 = 2^60
const ll INFL = 1LL << 60;
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD  = 998244353;
vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
ll pow_mod(ll x, ll k){
  x %= MOD; x += MOD; x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};

//最大公約数
ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

//最小公倍数
ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}

//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

const ll MAX_V = 200010;

ll par[MAX_V];
ll Rank[MAX_V];
ll child[MAX_V];
ll e[MAX_V];

void init_UF(ll n){
    for(ll i = 0; i < n; i++){
        par[i] = i;
        Rank[i] = 1;
        child[i] = 1;
    }
}

ll find(ll x){
    if(par[x] == x) return x;
    else{
        return par[x] = find(par[x]);
    }
}

bool same(ll x, ll y){
    return find(x) == find(y);
}

void unite(ll x, ll y){
    ll rx = find(x), ry = find(y);
    if(rx != ry){
        if(Rank[rx] >= Rank[ry]){
            par[ry] = rx;
            if(Rank[rx] == Rank[ry]) Rank[rx]++;
            child[rx] += child[ry];
        }else{
            par[rx] = ry;
            child[ry] += child[rx];
        }
        e[par[rx]] = e[rx] + e[ry] + 1;
    }else{
      e[rx]++;
    }
}

ll N, H, W;
vector<pair<ll, pair<ll, ll>>> A;

int main(){
  cin >> N >> H >> W;
  A.resize(N);
  rep(i, N){
    cin >> A[i].s.f >> A[i].s.s >> A[i].f;
    A[i].s.f--;
    A[i].s.s--;
    A[i].s.s += H;
  }
  sort(A.begin(), A.end());
  reverse(A.begin(), A.end());
  init_UF(200005);
  ll ans = 0;
  rep(i, N){
    ll r = A[i].s.f;
    ll c = A[i].s.s;
    if(same(r, c)){
      ll rr = find(r);
      if(e[rr] + 1 <= child[rr]){
        ans += A[i].f;
        unite(r, c);
      }
    }else{
      ll rr = find(r);
      ll rc = find(c);
      if(e[rr] + e[rc] + 1 <= child[rr] + child[rc]){
        ans += A[i].f;
        unite(r, c);
      }
    }
  }
  cout << ans << endl;
}


Measured memory_bytes: 9984