#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define eps (double)(1e-9)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<ll>> f(n, vector<ll>(n, inf));
    rep(i, m){
        ll s, t, d;
        cin >> s >> t >> d;
        s--; t--;
        chmin(f[s][t], d);
    }
    rep(i, n)f[i][i] = 0;
    rep(k, n)rep(i, n)rep(j, n){
        if(f[i][k] == inf || f[k][j] == inf)continue;
        chmin(f[i][j], f[i][k] + f[k][j]);
    }
    rep(i, n){
        ll ans = 0;
        rep(j, n)ans += f[i][j] * (f[i][j] < inf);
        cout << ans << endl;
    }
}