#include <cstdio>
#include <algorithm>
using namespace std;
const int B = 200;
struct edge {
    int x, y;
    long long s;
} E[200010];
int n, m;
long long k;
bool cmp1(edge a, edge b) {
    return a.s > b.s;
}
bool cmp2(edge a, edge b) {
    return a.s < b.s;
}
int fa[200010];
void init() {
    for (int i = 1; i <= n; i++) {
        fa[i] = i;
    }
}
int find(int x) {
    if (fa[x] == x) return x;
    return fa[x] = find(fa[x]);
}
long long kruscal(int su, int sv) {
    init();
    int cnt = 0;
    long long res = 0;
    if (su != 0) {
        fa[su] = sv;
        cnt = 1;
    } else {
        res = 1e18;
    }
    for (int i = 1; i <= m; i++) {
        if (su != 0 || E[i].s <= k) {
            int fu = find(E[i].x), fv = find(E[i].y);
            if (fu != fv) {
                fa[fu] = fv;
                cnt++;
                if (su != 0) res += max(0ll, E[i].s - k);
                else res = min(res, max(0ll, k - E[i].s));
                if (cnt == n - 1) {
                    return res;
                }
            }
        }
    }
    if (cnt < n - 1) {
        return -1;
    }
}
int main() {
    scanf("%d%d%lld", &n, &m, &k);
    for (int i = 1; i <= m; i++) {
        scanf("%d%d%lld", &E[i].x, &E[i].y, &E[i].s);
    }
    long long ans = 1e18;
    sort(E + 1, E + m + 1, cmp1);
    long long ans1 = kruscal(0, 0);
    if (ans1 != -1) {
        ans = ans1;
    }
    sort(E + 1, E + m + 1, cmp2);
    int pos = 0;
    for (int i = 1; i <= m; i++) {
        if (E[i].s >= k) {
            pos = i;
            break;
        }
    }
    if (pos == 0) {
        printf("%lld\n", ans);
        return 0;
    }
    if (n <= 2000) {
        for (int i = pos; i <= m; i++) {
            ans = min(ans, E[i].s - k + kruscal(E[i].x, E[i].y));
        }
    } else {
        for (int i = pos; i <= min(pos + B - 1, m); i++) {
            ans = min(ans, E[i].s - k + kruscal(E[i].x, E[i].y));
        }
        for (int i = max(pos, m - B + 1); i <= m; i++) {
            ans = min(ans, E[i].s - k + kruscal(E[i].x, E[i].y));
        }
    }
    printf("%lld\n", ans);
    return 0;
}