def warshall_floyd():
    for k in range(N):
        for i in range(N):
            for j in range(N):
                if D[i][k]!=10**18 and D[k][j]!=10**18:
                    D[i][j] = min(D[i][j], D[i][k]+D[k][j])

N, M = map(int, input().split())
D = [[10**18]*N for _ in range(N)]

for i in range(N):
    D[i][i] = 0
    
for _ in range(M):
    s, t, d = map(int, input().split())
    D[s-1][t-1] = min(D[s-1][t-1], d)

warshall_floyd()

for i in range(N):
    ans = 0
    
    for j in range(N):
        if D[i][j]!=10**18:
            ans += D[i][j]
    
    print(ans)