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(n)]
d_passed=[float('inf') for i in range(n)]



def f(d_now,now,ani):
  return (d_now*n+now)*2+ani
def invf(pop):
  ani=pop%2
  pop//=2
  now=pop%n
  d_now=pop//n
  return d_now,now,ani

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

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