#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

struct edge{
	int xi, yi, si;
	bool operator < (const edge &a) const{
		return si < a.si;
	}
};

int N, M, K;
long long ans = 0;
edge E[1000006];
int F[1000006];
vector<int> val;

int find(int x){
	if (F[x] == x) return x;
	F[x] = find(F[x]);
	return F[x];
}

void merge(int x, int y){
	int fx = find(x), fy = find(y);
	if (fx == fy) return;
	F[fx] = fy;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif

	scanf("%d %d %d", &N, &M, &K);
	for (int i = 1; i <= N; i ++) F[i] = i;
	for (int i = 1; i <= M; i ++){
		scanf("%d %d %d", &E[i].xi, &E[i].yi, &E[i].si);
	}
	sort(E + 1, E + M + 1);
	for (int i = 1; i <= M; i ++){
		if (find(E[i].xi) == find(E[i].yi)) continue;
		merge(E[i].xi, E[i].yi);
		val.push_back(E[i].si);
	}
	if (val.back() <= K){
		ans = K - val.back();
		int tmp = INT_MAX;
		for (int i = 1; i <= M; i ++){
			if (E[i].si <= K) continue;
			tmp = E[i].si;
			break;
		}
		ans = min(1LL * tmp - K, ans);
		tmp = -1;
		for (int i = 1; i <= M; i ++){
			if (E[i].si <= K) tmp = E[i].si;
			else break;
		}
		ans = min(1LL * K - tmp, ans);
	}else{
		for (auto && i : val){
			ans += max(0, i - K);
		}
	}
	printf("%lld\n", ans);
	
	return 0;
}