#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
const int MOD = 1000000007;
//const int MOD = 998244353;
const double PI = 3.14159265358979323846;

ll dist[105][105];

int main(){
    int n,m;
    cin >> n >> m;
    rep(i,n)rep(j,n) dist[i][j] = LINF;
    rep(i,n) dist[i][i] = 0;
    rep(i,m){
        int s,t;
        ll d;
        cin >> s >> t >> d;
        --s;--t;
        dist[s][t] = min(dist[s][t],d);
    }
    rep(k,n)rep(i,n)rep(j,n){
        if(dist[i][k] >= LINF || dist[k][j] >= LINF) continue;
        dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j]);
    }
    rep(i,n){
        ll ans = 0;
        rep(j,n){
            if(dist[i][j]>=LINF) continue;
            ans += dist[i][j];
        }
        cout << ans << endl;
    }
    return 0;
}