N,M = map(int,input().split())
G = {i:[] for i in range(1,N+1)}
for _ in range(M):
    s,t,d = map(int,input().split())
    G[s].append((t,d))
INFTY = 10**15
dp = [[INFTY for _ in range(N+1)] for _ in range(N+1)]
for i in range(1,N+1):
    dp[i][i] = 0
    for j,d in G[i]:
        dp[i][j] = d
for k in range(1,N+1):
    for i in range(1,N+1):
        for j in range(1,N+1):
            dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j])
for i in range(1,N+1):
    ans = 0
    for j in range(1,N+1):
        if dp[i][j]<INFTY:
            ans += dp[i][j]
    print(ans)