#include<bits/stdc++.h>
#define int long long
using namespace std;
using P=pair<int,int>;
const int INF=1e18;
struct edge{int to,cost;};
bool chmin(int&a,int b){if(a>b)return a=b,true;return false;}
int N,M,dist[1<<20];
vector<edge>G[1<<20];
signed main(){
    cin>>N>>M;
    while(M--){
        int a,b,c;cin>>a>>b>>c;
        G[a-1].push_back({b-1,c});
    }
    for(int i=0;i<N;i++){
        fill(dist,dist+N,INF);dist[i]=0;
        priority_queue<P,vector<P>,greater<P>>Q;Q.push({0,i});
        while(!Q.empty()){
            P p=Q.top();Q.pop();
            if(dist[p.second]<p.first)continue;
            for(edge e:G[p.second])if(chmin(dist[e.to],p.first+e.cost)){
                Q.push({dist[e.to],e.to});
            }
        }
        int sum=0;
        for(int i=0;i<N;i++)sum+=(dist[i]==INF?0:dist[i]);
        cout<<sum<<endl;
    }
}