//
// Created by zeronosu77108 on Jan 15, 2021.
//
#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>
#include <complex>
#include <optional>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<(v)<<endl;}

using int64 = long long;

int main() {
    int n, m;
    cin >> n >> m;

    vector dist(n+1, vector(n+1, optional<long>()));
    for (int i=0; i<m; i++) {
        long s, t, d;
        cin >> s >> t >> d;
        dist[s][t] = d;
    }
    for (int i=1; i<=n; i++) dist[i][i] = 0;


    for (int i=1; i<=n; i++) {
        for (int j=1; j<=n; j++) {
            for (int k=1; k<=n; k++) {
                if (!dist[j][i] || !dist[i][k]) continue;
                if (dist[j][k]) dist[j][k] = min(dist[j][k].value(), dist[j][i].value() + dist[i][k].value());
                else dist[j][k] = dist[j][i].value() + dist[i][k].value();
            }
        }
    }

    for (int i=1; i<=n; i++) {
        for (int j=1; j<=n; j++) {
            for (int k=1; k<=n; k++) {
                if (!dist[j][i] || !dist[i][k]) continue;
                if (dist[j][k]) dist[j][k] = min(dist[j][k].value(), dist[j][i].value() + dist[i][k].value());
                else dist[j][k] = dist[j][i].value() + dist[i][k].value();
            }
        }
    }


    vector ans(n+1, 0);
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=n; j++) {
            if (dist[i][j]) ans[i] += dist[i][j].value();
        }
    }

    for (int i=1; i<=n; i++) {
        cout << ans[i] << endl;
    }
}