from collections import defaultdict
from heapq import heappop, heappush

n, m = map(int, input().split())
G, RG = defaultdict(list), defaultdict(list)
for _ in range(m):
    u, v, t = map(int, input().split())
    u -= 1
    v -= 1
    G[u].append((v, t))
    RG[v].append((u, t))

INF = 10**18
def dijkstra(start, G):
    C = [INF for _ in range(n)]
    C[start] = 0
    H = [(0, start)]
    while H:
        ct, cp = heappop(H)
        if ct > C[cp]:
            continue
        for np, dt in G[cp]:
            nt = ct + dt
            if nt >= C[np]:
                continue
            C[np] = nt
            heappush(H, (nt, np))
    return C

CG = {n - 2: dijkstra(n - 2, G), n - 1: dijkstra(n - 1, G)}
CRG = {n - 2: dijkstra(n - 2, RG), n - 1: dijkstra(n - 1, RG)}
for i in range(n - 2):
    ans = INF
    ans = min(
        ans,
        CRG[n - 2][i] + CG[n - 2][n - 1] + CG[n - 1][i],
        CRG[n - 1][i] + CG[n - 1][n - 2] + CG[n - 2][i]
    )
    if ans == INF:
        ans = -1
    print(ans)