#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

template<typename T>
struct Weighted_Graph{
    struct edge{
        int to; T cost;
        edge(int to, T cost) : to(to), cost(cost) {}
    };

    vector<vector<edge>> es;
    vector<T> d;
    const T INF_T;
    const int n;

    Weighted_Graph(int n) : INF_T(numeric_limits<T>::max()/2), n(n){
        es.resize(n), d.resize(n);
    }

    void add_edge(int from, int to, T cost, bool directed = false){
        es[from].eb(to, cost);
        if(!directed) es[to].eb(from, cost);
    }

    bool bellman_ford(int s){ //sから到達可能な負閉路を検出
        fill(all(d), INF_T);
        d[s] = 0;
        bool ret = false;
        rep(i, 2*n){
            rep(j, n) each(e, es[j]){
                if(d[j] == INF_T) continue;
                if(chmin(d[e.to], d[j]+e.cost)){
                    if(i >= n-1) d[e.to] = -INF_T, ret = true;
                }
            }
        }
        return ret;
    }

    bool negative_loop(){ //全ての負閉路を検出
        fill(all(d), 0);
        rep(i, n){
            rep(j, n) each(e, es[j]){
                if(chmin(d[e.to], d[j]+e.cost)){
                    if(i == n-1) return true;
                }
            }
        }
    }

    void query(int i){
        bellman_ford(i);
        T ans = 0;
        rep(j, n) if(d[j] != INF_T) ans += d[j];
        cout << ans << '\n';
    }
};

int main(){
    int N, M;
    cin >> N >> M;
    Weighted_Graph<ll> G(N);

    rep(i, M){
        int u, v; ll w; cin >> u >> v >> w; u--, v--;
        G.add_edge(u, v, w, true);
    }

    rep(i, N) G.query(i);
}