import heapq
n,m,c=map(int,input().split())
v=[[] for i in range(n)]
for i in range(m):
  q,w,e=map(int,input().split())
  q-=1;w-=1
  v[q].append((w,e));v[w].append((q,e))
x=[];heapq.heappush(x,(0,0))
y=[1<<60]*n;y[0]=0
while x:
  q,w=heapq.heappop(x)
  if y[w]<q:
    continue
  for i,j in v[w]:
    if y[i]>q+j+c:
      y[i]=q+j+c
      heapq.heappush(x,(y[i],i))
a,b=[1<<60]*n,[1<<60]*n
a[-1]=0;b[-1]=0
x=[];heapq.heappush(x,(0,n-1,0))
while x:
  q,w,e=heapq.heappop(x)
  if a[w]<q and b[w]<q-e:
    continue
  for i,j in v[w]:
    if q+c+j-max(j,e)<b[i]:
      b[i]=q+c+j-max(j,e)
      heapq.heappush(x,(q+c+j,i,max(j,e)))
    if q+c+j<a[i]:
      a[i]=q+c+j
      heapq.heappush(x,(a[i],i,max(e,j)))
for i in range(1,n):
  print(min(y[-1],y[i]+b[i]))