//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
#define MOD 998244353
//#define MOD 1000000007
#define el '\n'
#define El '\n'
#define YESNO(x) ((x) ? "Yes" : "No")
#define YES YESNO(true)
#define NO YESNO(false)
#define EXIT_ANS(x) {cout << (x) << '\n'; return;}
template <typename T> void inline SORT(vector<T> &v){sort(v.begin(),v.end()); return;}
template <typename T> void inline REV(vector<T> &v){reverse(v.begin(),v.end()); return;}
template <typename T> void inline VEC_UNIQ(vector<T> &v){sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); return;}
template <typename T> T inline MAX(vector<T> &v){return *max_element(v.begin(),v.end());}
template <typename T> T inline MIN(vector<T> &v){return *min_element(v.begin(),v.end());}
template <typename T> T inline SUM(vector<T> &v){T ans = 0; for(int i = 0; i < (int)v.size(); i++)ans += v[i]; return ans;}
template <typename T> void inline DEC(vector<T> &v){for(int i = 0; i < (int)v.size(); i++)v[i]--; return;}
template <typename T> void inline INC(vector<T> &v){for(int i = 0; i < (int)v.size(); i++)v[i]++; return;}
void inline TEST(void){cerr << "TEST" << endl; return;}
template <typename T> bool inline chmin(T &x,T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
template <typename T> bool inline chmax(T &x,T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template <typename T = long long> vector<T> inline get_vec(int n){
    vector<T> ans(n);
    for(int i = 0; i < n; i++)cin >> ans[i];
    return ans;
}
template <typename T> void inline print_vec(vector<T> &vec,bool kaigyou = false){
    int n = (int)vec.size();
    for(int i = 0; i < n; i++){
        cout << vec[i];
        if(kaigyou || i == n - 1)cout << '\n';
        else cout << ' ';
    }
    if(!n)cout << '\n';
    return;
}
template <typename T> void inline debug_vec(vector<T> &vec,bool kaigyou = false){
    int n = (int)vec.size();
    for(int i = 0; i < n; i++){
        cerr << vec[i];
        if(kaigyou || i == n - 1)cerr << '\n';
        else cerr << ' ';
    }
    if(!n)cerr << '\n';
    return;
}
vector<vector<int>> inline get_graph(int n,int m = -1,bool direct = false){
    if(m == -1)m = n - 1;
    vector<vector<int>> g(n);
    while(m--){
        int u,v;
        cin >> u >> v;
        u--; v--;
        g[u].push_back(v);
        if(!direct)g[v].push_back(u);
    }
    return g;
}
template <typename T> vector<vector<pair<T,int>>> inline get_weighted_graph(int n,int m = -1,bool direct = false){
    if(m == -1)m = n - 1;
    vector<vector<pair<T,int>>> g(n);
    while(m--){
        int u,v;
        cin >> u >> v;
        u--; v--;
        ll w; cin >> w;
        g[u].push_back(pair(w,v));
        if(!direct)g[v].push_back(pair(w,u));
    }
    return g;
}

// ダイクストラ
// 引数はグラフのvectorと始点となるノード
//  ただしグラフのvectorの中身はg[i][j] =
//  {c,t}の時、点iから出ているj番目の矢印は、コストcでtへ向かうという意味
//  pairのfirstがコストなので注意！！！！
//  {他のノードへの距離を入れたvector,経路復元において1個前はどこに戻るか}を返す関数
// s→始点となるノード
pair<vector<long long>, vector<int>> ococo_dijkstra(vector<vector<pair<long long, int>>> const &g, int s) {
    vector<long long> distance(g.size(), LLONG_MAX);
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> que;
    que.emplace(0, s);
    vector<bool> visited(g.size(), false);
    distance[s] = 0;
    vector<int> prev(g.size(), -1);
    prev[s] = s;

    while(!que.empty()) {
        int karis = que.top().second;
        que.pop();
        if(!visited[karis]) {
            for(int i = 0; i < g[karis].size(); i++) {
                if(distance[g[karis][i].second] > distance[karis] + g[karis][i].first) {
                    distance[g[karis][i].second] = distance[karis] + g[karis][i].first;
                    que.emplace(distance[g[karis][i].second], g[karis][i].second);
                    prev[g[karis][i].second] = karis;
                }
            }
        }
        visited[karis] = true;
    }
    pair<vector<long long>, vector<int>> ans;
    ans.first = distance;
    ans.second = prev;
    return ans;
}


#define MULTI_TEST_CASE false
void solve(void){
    //問題を見たらまず「この問題設定から言えること」をいっぱい言う
    //よりシンプルな問題に言い換えられたら、言い換えた先の問題を自然言語ではっきりと書く
    //複数の解法のアイデアを思いついた時は全部メモしておく
    //g++ -D_GLIBCXX_DEBUG -Wall -O2 g.cpp -o o
    int n,m;
    ll c;
    cin >> n >> m >> c;
    vector<vector<pli>> g(n),gc(n);
    while(m--){
        int u,v;
        cin >> u >> v;
        u--; v--;
        ll w;
        cin >> w;
        g[u].push_back(pair(w,v));
        g[v].push_back(pair(w,u));
        gc[u].push_back(pair(w + c,v));
        gc[v].push_back(pair(w + c,u));
    }
    vector<ll> dij = ococo_dijkstra(gc,0).first;

    //cost_sum,idx,coupon_used
    using tlib = tuple<ll,int,bool>;
    vector<ll> used_cost(n,LLONG_MAX / 2);
    vector<ll> unused_cost(n,LLONG_MAX / 2);
    unused_cost[n - 1] = 0;
    priority_queue<tlib,vector<tlib>,greater<tlib>> que; que.push(tuple(0,n - 1,false));

    vector<bool> used_seen(n,false),unused_seen(n,false);
    while(!que.empty()){
        ll cost_sum;
        int idx;
        bool used;
        tie(cost_sum,idx,used) = que.top(); que.pop();
        if(used){
            if(used_seen[idx])continue;
            used_seen[idx] = true;
        }
        if(!used){
            if(unused_seen[idx])continue;
            unused_seen[idx] = true;
        }

        for(int i = 0; i < (int)gc[idx].size(); i++){
            int to = gc[idx][i].second;
            ll w = gc[idx][i].first;
            if(used){
                if(chmin(used_cost[to],cost_sum + w)){
                    que.push(tuple(cost_sum + w,to,true));
                }
            }
            if(!used){
                if(chmin(unused_cost[to],cost_sum + w)){
                    que.push(tuple(cost_sum + w,to,false));
                }
                if(chmin(used_cost[to],cost_sum + c)){
                    que.push(tuple(cost_sum + c,to,true));
                }
            }
        }
    }

    for(int i = 1; i < n; i++){
        ll ans = dij[n - 1];
        ll ans2 = dij[i];
        ans2 += used_cost[i];
        cout << min(ans,ans2) << el;
    }
    return;
}

void calc(void){
    return;
}

signed main(void){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE)cin >> t;
    while(t--){
        solve();
    }
    return 0;
}