// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
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(a > b){a = b; return 1;} return 0;}

struct edge{
  int to;
  ll cost;
  edge(int to, ll cost): to(to), cost(cost){}
  edge(){}
};
vector<edge> e[100001];

struct node{
  int at;
  int c;
  ll dis;
  node(int at, int c, ll dis): at(at), c(c), dis(dis){}
  node(){}
  bool operator<(const node &right) const{
    return dis > right.dis;
  }
};

ll dis[2][100001];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  rep(i, m){
    int a, b;
    ll c;
    cin >> a >> b >> c, a--, b--;
    e[a].pb(edge(b, c));
    e[b].pb(edge(a, c));
  }
  for(int i = 0; i < n; i++){
    for(int j = 0; j < 2; j++)dis[j][i] = linf;
  }
  dis[0][0] = 0;
  dis[1][0] = 0;
  priority_queue<node> pq;
  pq.push(node(0, 0, 0));
  pq.push(node(0, 1, 0));
  while(!pq.empty()){
    node p = pq.top(); pq.pop();
    if(dis[p.c][p.at] < p.dis)continue;
    dis[p.c][p.at] = p.dis;
    for(auto x: e[p.at]){
      ll tmp = p.dis + x.cost;
      if(tmp < dis[p.c][x.to]){
        pq.push(node(x.to, p.c, tmp));
        dis[p.c][x.to] = tmp;
      }
      if(p.c == 0){
        if(p.dis < dis[1][x.to]){
          pq.push(node(x.to, 1, p.dis));
          dis[1][x.to] = p.dis;
        }
      }
    }
  }
  for(int i = 0; i < n; i++){
    cout << dis[0][i] + dis[1][i] << endl;
  }
	return 0;
}