#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;
	}
}

using namespace std;

#define LL long long
#define N 200005

int n,m,u,v,pos1,pos2,pos3;
LL k,w,ans=1e18,ans1;
int head[N],f[N];

struct node
{
	int u,v;LL w;int idx;
	bool operator < (const node &a) const
	{
		return abs(w-k)<abs(a.w-k);
	 }
}e1[N],e2[N],e3[N];

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 cmp(node a,node b)
{
	return a.w<b.w;
}

bool Kruskal1()
{
	init();
	sort(e1+1,e1+pos1+1);
	int cnt=0;
	ans1=1e18;
	for(int i=1;i<=pos1&&cnt<n-1;i++){
		int u=e1[i].u,v=e1[i].v;LL w=e1[i].w;
		if(Judge(u,v)) continue ;
		cnt++;Merge(u,v);
		ans1=min(ans1,k-w);
	}
	return (cnt==n-1);
}

bool Kruskal2()
{
	init();
	sort(e2+1,e2+pos2+1);
	int cnt=0;
	ans1=0;
	for(int i=1;i<=pos2&&cnt<n-1;i++){
		int u=e2[i].u,v=e2[i].v;LL w=e2[i].w;
		if(Judge(u,v)) continue ;
		cnt++;Merge(u,v);
		ans1+=abs(w-k);
	}
	return (cnt==n-1);
}

bool Kruskal3()
{
	init();
	sort(e3+1,e3+pos3+1,cmp);
	int cnt=1;
	ans1=0;
	if(pos2==0) return false;
	int tot=e2[1].idx;ans1+=(e2[1].w-k);
	Merge(e2[1].u,e2[1].v);
	for(int i=1;i<=pos3&&cnt<n-1;i++){
		int u=e3[i].u,v=e3[i].v;LL w=e3[i].w;
		if(Judge(u,v)||e3[i].idx==tot) continue ;
		cnt++;Merge(u,v);
		if(w>k) ans1+=(w-k);
	}
	return true;
}


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);
		if(w<=k) e1[++pos1]={u,v,w,i};
		if(w>k) e2[++pos2]={u,v,w,i};
		e3[++pos3]={u,v,w,i};
	}
	if(Kruskal1())
		ans=min(ans,ans1);
	if(Kruskal2())
		ans=min(ans,ans1);
	if(Kruskal3())
		ans=min(ans,ans1);
	printf("%lld",ans);
}