import heapq

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))

checked=set()
checked_passed=set()
d=[float('inf') for i in range(n)]
d[-1]=0
d_passed=[float('inf') for i in range(n)]
q=[]
heapq.heappush(q,[0,n-1,0])

while q and len(checked_passed)<n:
  d_now,now,ani=heapq.heappop(q)
  #print(d_now,now,ani)
  if ani==0:
    if now in checked:continue
    checked.add(now)
    d[now]=d_now
  else:
    if now in checked_passed:continue
    checked_passed.add(now)
    d_passed[now]=d_now
  for nxt,c,x in G[now]:
    if ani==0 and x==0:
      if nxt not in checked:
        heapq.heappush(q,[d_now+c,nxt,0])
    else:
      if nxt not in checked_passed:
        heapq.heappush(q,[d_now+c,nxt,1])

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