#チャッピー
import heapq

INF = 10**18

# ステップ1. 入力の受取り
N, M, C = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
    u, v, w = map(int, input().split())
    u -= 1
    v -= 1
    w += C  # 利用料金の加算
    G[u].append((v, w))
    G[v].append((u, w))

# ステップ2. 頂点1から頂点iまでの最短距離を求める
Dist_1_to_i = [INF] * N
Q = []  # (距離, 現在の街)
heapq.heappush(Q, (0, 0))
Dist_1_to_i[0] = 0

while Q:
    now_dist, now_pos = heapq.heappop(Q)
    if Dist_1_to_i[now_pos] != now_dist:
        continue
    for nex_pos, nex_dist in G[now_pos]:
        if Dist_1_to_i[nex_pos] > now_dist + nex_dist:
            Dist_1_to_i[nex_pos] = now_dist + nex_dist
            heapq.heappush(Q, (Dist_1_to_i[nex_pos], nex_pos))

# ステップ3. 頂点(状態3,N) から頂点(状態2,i) までの最短距離を求める.
Dist_N_to_i = [[INF] * N for _ in range(4)]
R = []  # (距離, 現在の状態, 現在の街)
heapq.heappush(R, (0, 3, N - 1))
Dist_N_to_i[3][N - 1] = 0

while R:
    now_dist, now_state, now_pos = heapq.heappop(R)

    # 隣接ノード確認
    for nex_pos, nex_dist in G[now_pos]:

        # 状態そのままの遷移
        if Dist_N_to_i[now_state][nex_pos] > Dist_N_to_i[now_state][now_pos] + nex_dist:
            Dist_N_to_i[now_state][nex_pos] = Dist_N_to_i[now_state][now_pos] + nex_dist
            heapq.heappush(R, (Dist_N_to_i[now_state][nex_pos], now_state, nex_pos))

        # 状態3 → 状態2 へ遷移（ガソリン代無料部分）
        if now_state == 3:
            if Dist_N_to_i[2][nex_pos] > Dist_N_to_i[now_state][now_pos] + C:
                Dist_N_to_i[2][nex_pos] = Dist_N_to_i[now_state][now_pos] + C
                heapq.heappush(R, (Dist_N_to_i[2][nex_pos], 2, nex_pos))

# ステップ4. 解答の出力
for i in range(1, N):
    answer = min(Dist_1_to_i[i] + Dist_N_to_i[2][i], Dist_1_to_i[N - 1])
    print(answer)