#import<bits/stdc++.h>
#define p push_back
using namespace std;using l=long;using pl=pair<l,l>;vector<l> D(l N,l S,auto G){vector<l>d(N,1e18),v(N);priority_queue<pl,vector<pl>,greater<pl>>Q;d[S]=0;Q.push({0,S});while(!Q.empty()){l p=Q.top().second;Q.pop();if(v[p])continue;v[p]=1;for(auto[n,c]:G[p])if(d[n]>d[p]+c){d[n]=d[p]+c;Q.push({d[n],n});}}return d;}l n,m,c,u,v,w,i=1;main(){cin>>n>>m>>c;vector<vector<pl>>g(n),G(n*2);for(;m--;)cin>>u>>v>>w,u--,v--,g[u].p({v,w+c}),g[v].p({u,w+c}),G[u].p({v,w+c}),G[v].p({u,w+c}),G[u].p({v+n,c}),G[v].p({u+n,c}),G[u+n].p({v+n,w+c}),G[v+n].p({u+n,w+c});for(vector<l>a=D(n,0,g),b=D(n*2,n-1,G);i<n;i++)cout<<min(a[n-1],a[i]+b[i+n])<<endl;}