#include<bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include<atcoder/all>
#endif
// using namespace std;
// using namespace atcoder;
#define int long long
#define rep(i, n) for(int i = 0;i<(int)(n);i++)
#define all(v) (v).begin(),(v).end()
using lint = long long;
using ll = long long;
using P = std::pair<int,int>;

constexpr int inf = 2e18;

struct edge{int to,cost;};

bool chmin(int &a,const int b) {
    if(a>b) {
        a=b;
        return true;
    }
    return false;
}

int n,m;
std::vector<edge> G[110];

std::vector<int> dijkstra(int s) {
    std::vector<int> dist(n);
    std::fill(all(dist),inf);
    dist[s]=0;
    std::priority_queue<P,std::vector<P>,std::greater<P>> pri;
    pri.push({0,s});
    while(!pri.empty()) {
        P p = pri.top();pri.pop();
        int v = p.second;
        if(dist[v]<p.first) continue;
        for(auto &e:G[v]) if(chmin(dist[e.to],dist[v]+e.cost)) pri.push({dist[e.to],e.to});
    }
    return dist;
}

int dist[110][110];

signed main(void) {
    rep(i, 110) rep(j, 110) if(i!=j) dist[i][j]=inf;
    std::cin >> n >> m;
    rep(i, m) {
        int s,t,d;
        std::cin >> s >> t >> d;
        s--,t--;
        // G[s].push_back({t,d});
        chmin(dist[s][t],d);
    }
    rep(i, n) rep(j, n) if(i!=j&&dist[i][j]!=inf) G[i].push_back({j,dist[i][j]});
    rep(i, n) {
        int sum = 0;
        std::vector<int> v = dijkstra(i);
        for(auto &p:v) if(p!=inf) sum+=p;
        // rep(j, n) sum+=dijkstra(i,j);
        std::cout << sum << std::endl;
    }
    return 0;
}