import sys
from heapq import heappush, heappop

input = sys.stdin.buffer.readline
INF = 10 ** 15


def dijkstra(N, G, s):
    dist = [INF] * N
    que = [(0, s)]
    dist[s] = 0
    while que:
        c, v = heappop(que)
        if dist[v] < c:
            continue
        for t, cost in G[v]:
            if dist[v] + cost < dist[t]:
                dist[t] = dist[v] + cost
                heappush(que, (dist[t], t))
    return dist


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

for _ in range(M):
    A, B, C, X = map(int, input().split())
    A -= 1
    B -= 1
    G[A].append((B, C))
    G[B].append((A, C))
    G[A + N].append((B + N, C))
    G[B + N].append((A + N, C))
    if X:
        G[A].append((B + N, C))
        G[B].append((A + N, C))
        G[A + N].append((B, C))
        G[B + N].append((A, C))

dist = dijkstra(2 * N, G, 2 * N - 1)
print(*dist[:N - 1], sep='\n')