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

INF = 10**18

# Initialize distance matrix with 1-based indexing
dist = [[INF] * (n + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
    dist[i][i] = 0

for _ in range(m):
    s, t, d = map(int, input().split())
    if dist[s][t] > d:
        dist[s][t] = d

# Floyd-Warshall algorithm to compute all pairs shortest paths
for k in range(1, n + 1):
    for i in range(1, n + 1):
        for j in range(1, n + 1):
            if dist[i][k] + dist[k][j] < dist[i][j]:
                dist[i][j] = dist[i][k] + dist[k][j]

# Calculate and print the sum for each node
for i in range(1, n + 1):
    total = 0
    for j in range(1, n + 1):
        if i != j and dist[i][j] < INF:
            total += dist[i][j]
    print(total)