#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 200010
#define pint pair<int,int>
#define fir first
#define sec second
int n,m,k,dfn[MAXN],low[MAXN],js=0,cnt=0,pid[MAXN];
vector<pint>g[MAXN];
vector<int>jev[MAXN];
stack<int>spt;
void tarjan(int id,int fr){
	dfn[id]=low[id]=++js;spt.push(id);
	vector<int>base;
	for(int i=0;i<g[id].size();++i)if(g[id][i].fir!=fr)
		if(!dfn[g[id][i].fir]){
			tarjan(g[id][i].fir,id);
			low[id]=min(low[id],low[g[id][i].fir]);
		}else low[id]=min(low[id],dfn[g[id][i].fir]);
	if(dfn[id]==low[id]){
		int v;++cnt;
		do{v=spt.top(),spt.pop();pid[v]=cnt;}while(v!=id);
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>m>>k;
	for(int i=1,u,v,w;i<=m;++i)
		cin>>u>>v>>w,g[u].push_back({v,w}),g[v].push_back({u,w});
	for(int i=1;i<=n;++i)if(!dfn[i]){
		tarjan(i,0);
		if(!spt.empty())
			++cnt;while(!spt.empty()) pid[spt.top()]=cnt,spt.pop();
	}vector<int>mik;
	for(int i=1;i<=n;++i)for(int j=0;j<g[i].size();++j)
		if(pid[i]!=pid[g[i][j].fir]) mik.push_back(g[i][j].sec);
		else jev[pid[i]].push_back(g[i][j].sec);
	ll ans=0;
	for(int i=0;i<mik.size();++i) ans+=max(0,mik[i]-k);
	for(int i=1;i<=cnt;++i){
		int val=INT_MAX;
		for(int j=0;j<jev[i].size();++j)
			if(abs(val-k)>abs(jev[i][j]-k)) val=jev[i][j];
		if(val!=INT_MAX) ans+=abs(val-k);
	}cout<<ans<<endl;
	return 0;
}