import sys
sys.setrecursionlimit(1000)
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))
visited = [False]*(N+1)
INFTY = 10**15
dist = [INFTY]*(N+1)
def dfs(v):
    visited[v] = True
    for w,d in G[v]:
        if not visited[w] and dist[w]>dist[v]+d:
            dist[w] = dist[v]+d
            dfs(w)
    visited[v] = False
for u in range(1,N+1):
    dist = [INFTY]*(N+1)
    dist[u] = 0
    visited = [False]*(N+1)
    dfs(u)
    ans = 0
    for v in range(1,N+1):
        if dist[v]<INFTY:
            ans += dist[v]
    print(ans)