#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int N=3e5+15;
int n,m,k,ans,cnt;
int fa[N];
struct edge{
	int u,v,w;
}e[N];
bool cmp(edge a,edge b){
	return a.w<b.w;
}
int find(int x){
	return x==fa[x]?x:(fa[x]=find(fa[x]));
}
void join(int x,int y){
	int f1=find(x),f2=find(y);
	if(f1!=f2)fa[f1]=f2;
}
int kruskal(){
	rep(i,1,n)fa[i]=i;
	sort(e+1,e+m+1,cmp);
	rep(i,1,m){
		if(find(e[i].u)!=find(e[i].v)){
			join(e[i].u,e[i].v);
			cnt=max(cnt,e[i].w);
			if(cnt>k)ans+=cnt-k;
		}
	}
	if(cnt<k){
		ans=0x3f3f3f3f;
		rep(i,1,m){
			ans=min(ans,abs(k-e[i].w));
		}
	}
	return ans;
}
void solve(){
	ans=cnt=0;
	cin>>n>>m>>k;
	rep(i,1,m){
		int u,v,w;
		cin>>u>>v>>w;
		e[i]=(edge){u,v,w};
	}
	cout<<kruskal()<<endl;
	
}
signed main(){
	ios::sync_with_stdio(0);
	int T=1;
//	cin>>T;
	while(T--)solve();
	return 0;
}