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)] for j in range(2)] #d=[float('inf') for i in range(n)] #d_passed=[float('inf') for i 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==0: if d_now>=d[0][now] or d_now>=d[1][now]:continue d[now]=d_now else: if d_now>=d[1][now]:continue d[1][now]=d_now for nxt,c,x in G[now]: if ani==0 and x==0: heapq.heappush(q,[d_now+c,nxt,0]) else: heapq.heappush(q,[d_now+c,nxt,1]) for i in range(n-1): print(d[1][i])