#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>

using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")

mt19937 rnd(238);

#define len(a) (int) a.size()
#define pb push_back
#define pbb pop_back
#define all(a) a.begin(), a.end()
#define rev reverse
#define fi first
#define se second
#define vec vector
#define str string
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define umap unordered_map
#define pri pair<int, int>
#define prl pair<ll, ll>

const int MOD = 1e9 + 7;
const int BLOCK_SZ = 1000;
const ll inf = 1e18;
const int INF = 1e9;
const int mod = 1e9 + 7;
vector<vector<pair<int, ll>>> g;

void dijkstra(int s, vec<ll> &d) {
    d[s] = 0;
    set<pair<ll, int>> q;
    q.emplace(d[s], s);
    while (!q.empty()) {
        auto l = *q.begin();
        int v = l.se;
        q.erase(l);
        for (auto [to, w]: g[v]) {
            if (d[to] > d[v] + w) {
                q.erase({d[to], to});
                d[to] = d[v] + w;
                q.insert({d[to], to});
            }
        }
    }
}

void solve() {
    int n, m;
    ll c;
    cin >> n >> m >> c;
    g.resize(n);
    ll sum = 0;
    while (m--) {
        int u, v;
        ll w;
        cin >> u >> v >> w;
        g[u - 1].pb({v - 1, w});
        g[v - 1].pb({u - 1, w});
        sum += w;
    }
    vector<ll> d(n, inf);
    dijkstra(0, d);
    vector<pair<ll, int>> arr;
    for (int i = 0; i < n; i++) {
        arr.pb({d[i], i});
    }
    sort(all(arr));
    set<ll> s;
    ll ans = inf;
    for (int i = 0; i < n; i++) {
        for (auto [u, w]: g[arr[i].se]) {
            if (s.find(u) != s.end()) {
                sum -= w;
            }
        }
        s.insert(arr[i].fi);
        ans = min(ans, c * arr[i].fi + sum);
    }
    cout << ans;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    while (_--) solve();
}