#include <bits/stdc++.h>
using namespace std;
int n;
struct edge{
	int u;
	int v;
	int w;
}s[202222];
int m,k;
bool cmp(edge a,edge b) {
	return a.w < b.w;
}
int fa[200222];
int getf(int x) {
	if(x == fa[x]) return x;
	else return fa[x] = getf(fa[x]);
}
int main(){
	cin >> n >> m >> k;
	for(int i = 1;i <= m;i ++) 
		cin >> s[i].u >> s[i].v >> s[i].w;
	sort(s + 1,s + m + 1,cmp);
	for(int i = 1;i <= n;i ++)
	fa[i] = i;
	int minn2 = 1020222222;
	int cnt = 0;
	for(int i = 1;i <= m;i ++) {
		if(s[i].w <= k) {
			int u = getf(s[i].u);
			int v = getf(s[i].v);
			if(u != v) {
				cnt ++;
				fa[v] = u;
			}
		}
		minn2 = min(minn2,abs(k - s[i].w));
	}
	if(cnt == n - 1) {
		cout << minn2;
		return 0;
	}
	long long ans = 0;
	for(int i = 1;i <= m;i ++) {
		if(s[i].w > k) {
			int u = getf(s[i].u);
			int v = getf(s[i].v);
			if(u != v) {
				cnt ++;
				fa[v] = u;
				ans += s[i].w - k;
			}
		}
	}
	cout << ans;
}