#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
#include<random>

#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0LL,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,n) RFOR(i,0LL,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x)
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())
#define pb push_back
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
const ll inf = 2222222222222222222LL;
const ll mod = 1000000007LL;

ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf;
string s;
bool ok;
ll dx[9] = { 0,1,-1,0,0,1,1,-1,-1 }, dy[9] = { 0,0,0,1,-1,1,-1,1,-1 };
#define endl '\n'
#pragma endregion
#define MAX 222222


ll dist[MAX][2];
vpll edge[MAX];



int main(void) {
  ios::sync_with_stdio(false); cin.tie(0);


  cin >> n >> m;
  rep(i, m) {
    ll a, b, c;
    cin >> a >> b >> c;
    edge[a].pb(make_pair(c, b));
    edge[b].pb(make_pair(c, a));
  }

  priority_queue<pll, vector<pll>, greater<pll>> pq;
  pll p;
  FOR(i, 2, n + 1) rep(j, 2) dist[i][j] = inf;
  pq.push(make_pair(0, 1));
  ll cur;
  while (!pq.empty()) {
    p = pq.top(); pq.pop();
    cur = p.second;
    if (dist[cur][0] < p.first && dist[cur][1] < p.first) continue;
    rep(i,edge[cur].size()) {
      ll to = edge[cur][i].second;
      if (dist[to][1] > dist[cur][0]) {
        dist[to][1] = dist[cur][0];
        pq.push(make_pair(dist[to][1], to));
      }
      if (dist[to][0] > dist[cur][0] + edge[cur][i].first) {
        dist[to][0] = dist[cur][0] + edge[cur][i].first;
        pq.push(make_pair(dist[to][0], to));
      }
      if (dist[to][1] > dist[cur][1] + edge[cur][i].first) {
        dist[to][1] = dist[cur][1] + edge[cur][i].first;
        pq.push(make_pair(dist[to][1], to));
      }
    }
  }

  FOR(i, 1, n + 1) {
    cout << dist[i][0] + dist[i][1] << endl;
  }

  return 0;
}