import sys
import heapq
from decimal import Decimal, getcontext

INF = -1
MOD = int(1e9 + 7)

n, m = map(int, input().split())

csucsok = [[] for _ in range(n)]
hossz = [[] for _ in range(n)]
for _ in range(m):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1

    csucsok[a].append(b)
    hossz[a].append(c)
    csucsok[b].append(a)
    hossz[b].append(c)

class Comp:
    def __init__(self, ans, mely):
        self.ans = ans
        self.mely = mely

    def __call__(self, a, b):
        if self.ans[a] == self.ans[b]:
            return self.mely[a] > self.mely[b]
        return self.ans[a] > self.ans[b]

bejar = []
ans = [INF] * n
ans[0] = 0
heapq.heappush(bejar, (ans[0], 0))
bejart = [False] * n
opciok = [[INF] * (n + 2) for _ in range(n)]
opciok[0][1] = 0
mely = [0] * n

while bejar:
    akt = heapq.heappop(bejar)[1]

    if bejart[akt]:
        continue

    #print(akt);

    bejart[akt] = True

    for i in range(len(csucsok[akt])):
        kovi = csucsok[akt][i]
        suly = hossz[akt][i]

        if bejart[kovi]:
            continue

        for j in range(1, n + 1):
            if opciok[akt][j] == -1:
                continue

            tav = opciok[akt][j] + suly * int(1 << (j - 1))

            if(opciok[kovi][j + 1]) == -1:
                opciok[kovi][j + 1] = tav;
            else:
                opciok[kovi][j + 1] = int(min(int(opciok[kovi][j + 1]), int(tav)))

            if ans[kovi] > tav or ans[kovi] == -1:
                mely[kovi] = j + 1
                ans[kovi] = int(tav);
            

        heapq.heappush(bejar, (int(ans[kovi]), kovi))

for i in range(1, n):
    print(ans[i] % MOD)