def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx += 1
    M = int(input[idx])
    idx += 1

    INF = 1 << 60
    distance = [[INF] * (N + 1) for _ in range(N + 1)]
    for i in range(1, N + 1):
        distance[i][i] = 0

    for _ in range(M):
        s = int(input[idx])
        t = int(input[idx + 1])
        d = int(input[idx + 2])
        idx += 3
        if distance[s][t] > d:
            distance[s][t] = d

    # Floyd-Warshall
    for k in range(1, N + 1):
        for i in range(1, N + 1):
            for j in range(1, N + 1):
                if distance[i][k] < INF and distance[k][j] < INF:
                    new_dist = distance[i][k] + distance[k][j]
                    if new_dist < distance[i][j]:
                        distance[i][j] = new_dist

    # Calculate sums
    for i in range(1, N + 1):
        total = 0
        for j in range(1, N + 1):
            if i == j:
                continue
            if distance[i][j] < INF:
                total += distance[i][j]
        print(total)

if __name__ == '__main__':
    main()