#include<bits/stdc++.h>

namespace IO
{
	template<typename Type>
	void read(Type &x){
		char ch=getchar();
		x=0;bool f=0;
		while(ch<'0'||ch>'9')
			f|=(ch=='-'),ch=getchar();
		while(ch>='0'&&ch<='9')
			x=((x<<1)+(x<<3)+(ch^48)),ch=getchar();
		x=f?-x:x;
	}
}

#define N 200005
#define LL long long
using namespace std;

int n,m,k,u,v,w;
int f[N];

LL ans1=1e18,ans2=-1e18;

void init(){for(int i=1;i<=n;i++)f[i]=i;}
int find(int x){return (x==f[x])?x:f[x]=find(f[x]);}
void Merge(int a,int b){f[find(a)]=find(b);}
bool Judge(int a,int b){return find(a)==find(b);}

bool tag[N];

struct Edge
{
	int u,v,w;
	bool operator < (const Edge &a) const
	{
		return w<a.w;
	}
}e[N];

void Kruskal1()
{
	int cnt=0;
	for(int i=1;i<=m&&cnt<n-1;i++){
		int u=e[i].u,v=e[i].v,w=e[i].w;
		if(Judge(u,v)) continue ;
		Merge(u,v);cnt++;
		if(w>=k) ans1+=(w-k);
	}
}

void Kruskal2()
{
	int cnt=0;
	LL res1=1e18,res2=0;
	for(int i=1;i<=m&&cnt<n-1;i++){
		int u=e[i].u,v=e[i].v,w=e[i].w;
		if(Judge(u,v)) continue ;
		Merge(u,v);cnt++;
		if(w<=k) res1=min(res1,1ll*k-w);
		else res2+=(w-k);
	}
	ans2=res2?res2:res1;
}

bool cmp(Edge a,Edge b)
{
	if(a.w<k&&b.w>=k) return true;
	if(a.w>k&&b.w<=k) return false;
	return abs(k-a.w)<abs(k-b.w);
}

int main()
{
	IO::read(n);IO::read(m);IO::read(k);
	for(int i=1;i<=m;i++){
		IO::read(u);IO::read(v);IO::read(w);
		e[i]={u,v,w};
	}
	sort(e+1,e+m+1);bool op=false;
	for(int i=1;i<=m;i++)
		if(e[i].w>=k){Merge(e[i].u,e[i].v);tag[i]=true;ans1=e[i].w-k;op=true;break;}
	init();
	if(op) Kruskal1();
	init();
	sort(e+1,e+m+1,cmp);
	Kruskal2();
	printf("%lld",min(ans1,ans2));
}