#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
int n, m, k, fa[N];
int dian[N], bian[N];
long long ans = 0;
struct ren {
	int u, v, w;
} a[N];
bool cmp(ren n1, ren n2) {
	return n1.w < n2.w;
}
int find(int x) {
	return fa[x] == x ? x : fa[x] = find(fa[x]);
}
int main() {
	cin >> n >> m >> k;
	for (int i = 1; i <= m; i++) {
		cin >> a[i].u >> a[i].v >> a[i].w;
		dian[i] = 1;
	}
	for (int i = 1; i <= n; i++) {
		fa[i] = i;
	}
	sort(a + 1, a + 1 + m, cmp);
	for (int i = m; i >= 1; i--) {
		int fx = find(a[i].u), fy = find(a[i].v);
		if (fx != fy) {
			if (bian[fx] > bian[fy]) {
				int t = fy;
				fy = fx;
				fx = t;
			}
			if (dian[fx] + dian[fy] - bian[fy] - bian[fx] - 1 >= k) {
				fa[fx] = fy;
				dian[fy] += dian[fx];
				bian[fy] += bian[fx] + 1;
				ans += a[i].w;
//				cout << fy << " " << dian[fy] << " " << bian[fy] << endl;
			}
		} else {
			if (bian[fx] > bian[fy]) {
				int t = fy;
				fy = fx;
				fx = t;
			}
			if (dian[fy] - bian[fy] - 1 >= k) {
				bian[fy]++;
				ans += a[i].w;
//				cout << fy << " " << dian[fy] << " " << bian[fy] << endl;
			}
		}
	}
	cout << ans << endl;
	return 0;
}