from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
# setrecursionlimit(2000000) # これこどふぉだと無理
# set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 10**18
from collections import defaultdict,deque
from heapq import heappop,heappush
# from random import randint
# from itertools import permutations 



def dijkstra(g,start,n):
    """
    g:グラフ、strat:始点,n:頂点数 -> 距離のリスト
    """
    inf = 10**18 
    dist = [inf]*n 
    dist[start] = 0 
    kakutei = [0]*n 
    que = []
    heappush(que,(0,start))
    while que:
        d,v = heappop(que)
        if kakutei[v]:
            continue 
        kakutei[v] = 1 
        for i,c in g[v]:
            if dist[i] > dist[v] + c:
                dist[i] = dist[v] + c 
                heappush(que,(dist[i],i))
    return dist


n,m,C = mi() 

g = defaultdict(list) 

for _ in range(m):
    u,v,w = gmi() 
    w += 1 
    g[u].append((v,w))
    g[v].append((u,w)) 


dist = [inf]*n 
dist[0] = 0 
kakutei = [0]*n 
que = []
heappush(que,(0,0))
while que:
    d,v = heappop(que)
    if kakutei[v]:
        continue 
    kakutei[v] = 1 
    for i,c in g[v]:
        if dist[i] > dist[v] + c + C:
            dist[i] = dist[v] + c + C
            heappush(que,(dist[i],i))
memo = dist
dist = [inf]*n 
dist1 = [inf]*n 
dist[-1] = 0 
dist1[-1] = 0 
kakutei = [0]*2*n 
que = []
heappush(que,(0,n-1))
heappush(que,(0,2*n-1))
while que:
    d,v = heappop(que)
    if kakutei[v]:
        continue 
    kakutei[v] = 1 
    if v < n:
        for i,c in g[v]:
            if dist[i] > dist[v] + c + C:
                dist[i] = dist[v] + c + C
                heappush(que,(dist[i],i))
            if dist1[i] > dist[v] + C:
                dist1[i] = dist[v] + C 
                heappush(que,(dist1[i],i+n))
    else:
        v -= n 
        for i,c in g[v]:
            if dist1[i] > dist1[v] + c + C:
                dist1[i] = dist1[v] + c + C
                heappush(que,(dist1[i],i+n))        

for i in range(1,n):
    print(min(memo[-1],memo[i] + dist1[i]))