import sys
readline = sys.stdin.readline
from heapq import heappush, heappop
inf = float('inf')


def dijkstra(s, g, N):
    # ゴールがない場合はg=-1とする。

    def cost(v, m):
        return v * N + m

    dist = [inf] * N
    mindist = [inf] * N
    seen = [False] * N
    Q = [cost(0, s)]
    while Q:
        c, m = divmod(heappop(Q), N)
        if seen[m]:
            continue
        seen[m] = True
        dist[m] = c
        if m == g:
            return dist

        #------heapをアップデートする。--------
        for u, C in G[m]:
            if seen[u]:
                continue
            newdist = dist[m] + C

            #------------------------------------
            if newdist >= mindist[u]:
                continue
            mindist[u] = newdist
            heappush(Q, cost(newdist, u))
    return dist


N, M = map(int, readline().split())
G = [[] for i in range(2 * N)]
for i in range(M):
    A, B, C, X = map(int, readline().split())
    A, B = A - 1, B - 1
    if X:
        G[A].append((B + N, C))
        G[B].append((A + N, C))
        G[A + N].append((B + N, C))
        G[B + N].append((A + N, C))
    else:
        G[A].append((B, C))
        G[B].append((A, C))
        G[A + N].append((B + N, C))
        G[B + N].append((A + N, C))
        
D = dijkstra(N - 1, -1, 2 * N)
for i in range(N - 1):
    print(D[i + N])