#include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i >= n; --i)
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }

struct edge {
  int to, cost;
};
typedef pair<ll, ll> P;

vector<priority_queue<ll,vector<ll>,greater<ll>>> Q;
vector<priority_queue<ll,vector<ll>,greater<ll>>> Q2;
int used[101010];
int N, M;
vector<vector<edge>> G;
void dfs(int s, int v, int mx, ll cost) {
  if(v == 0) {
    Q[s].push(cost);
    Q2[s].push(cost - mx);
    return;
  }
  if(used[v]) return;
  used[v] = 1;
  for(auto nv : G[v]) {
    dfs(s, nv.to, max(mx, nv.cost), cost + nv.cost);
  }
  used[v] = 0;
}

int main() {
  cin >> N >> M;
  G.assign(N, vector<edge>());
  rep(i, 0, M) {
    int a, b, c;
    cin >> a >> b >> c;
    a--, b--;
    G[a].push_back({b, c});
    G[b].push_back({a, c});
  }
  Q.resize(N);
  Q2.resize(N);
  rep(i, 0, N) {
    dfs(i, i, 0, 0);
    ll cost1 = Q[i].top();
    ll cost2 = Q2[i].top();
    cout << cost1 + cost2 << "\n";
  }
  return 0;
}