import heapq
import sys
input=sys.stdin.readline
n,m=map(int,input().split())

G=[[] for i in range(n)]

for i in range(m):
  a,b,c,x=map(int,input().split())
  G[a-1].append((b-1,c,x))
  G[b-1].append((a-1,c,x))

d=[[float('inf') for i in range(2)] for j in range(n)]

q=[]
heapq.heappush(q,(0,n-1,0))

while q:
  #print(q)
  d_now,now,ani=heapq.heappop(q)
  #print(d_now,now,ani)
  if ani:
    if d_now>d[now][1]:continue
    d[now][1]=d_now
    for nxt,c,x in G[now]:
      heapq.heappush(q,(d_now+c,nxt,1))
  else:
    if d_now>d[now][0] or d_now>d[now][1]:continue
    d[now][0]=d_now
    for nxt,c,x in G[now]:
      if x:heapq.heappush(q,(d_now+c,nxt,1))
      else:heapq.heappush(q,(d_now+c,nxt,0))

for i in range(n-1):
  print(d[i][1])