#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m,k;
int fa[200005],fa1[200005];
int find(int x){
//	cout << x << endl;
	if(fa[x] == x)return x;
	return fa[x] = find(fa[x]);
}void merge(int x,int y){
	if(find(x) == find(y))return;
	fa[find(x)] = find(y);
}int find1(int x){
	if(fa1[x] == x)return x;
	return fa1[x] = find1(fa1[x]);
}void merge1(int x,int y){
	if(find1(x) == find1(y))return;
	fa1[find1(x)] = find1(y);
}vector<pair<pair<int,int>,int> >edge;
bool cmp(pair<pair<int,int>,int>a,pair<pair<int,int>,int>b){
	return a.second<b.second;
}
signed main(){
	cin>>n>>m>>k;
	for(int i = 1;i<=n;i++)fa[i] = fa1[i] = i;
	int mx =0,mn =2000000005;
	for(int i = 1;i<=m;i++){
		int a,b,c;cin >> a >> b >> c;
		if(c<=k){
			merge1(a,b);mx = max(mx,c);
		}else{
			edge.push_back({{a,b},c-k});mn = min(mn,c-k);
		}
	}int tot = 0;
	for(int i = 1;i<=n;i++)if(fa1[i] == i)tot++;
//	cout << 2 << endl;
	if(tot == 1){
		cout << min(k-mx,mn) << '\n';return 0;
	}else{
		sort(edge.begin(),edge.end(),cmp);
		int ans =0 ;
		for(int i =0;i<edge.size();i++){
			int a = edge[i].first.first,b = edge[i].first.second;
	//		cout <<a << " " << b << endl;
			if(find(find1(a))!=find(find1(b))){
				merge(find1(a),find1(b));ans+=edge[i].second;
			}
		}cout << ans << endl;
	}
	return 0;
}