import sys
input = sys.stdin.readline
from heapq import *

def dijkstra():
    dist = [[10**18]*N for _ in range(2)]
    dist[0][N-1] = 0
    pq = []
    heappush(pq, (0, N-1))
    
    while pq:
        d, tv = heappop(pq)
        t, v = divmod(tv, 10**6)
        
        if dist[t][v]<d:
            continue
        
        for nv, w, x in G[v]:
            nt = t|(x==1)
            
            if dist[nt][nv]>dist[t][v]+w:
                dist[nt][nv] = dist[t][v]+w
                heappush(pq, (dist[nt][nv], 10**6*nt+nv))
    
    return dist

N, M = map(int, input().split())
G = [[] for _ in range(N)]

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

dist = dijkstra()

for i in range(N-1):
    print(dist[1][i])