#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double

vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}

const int inf = 1e18L + 5;
vector<pair<int, int>> *G;
vector<int> D,P;

void Dijkstra(int s,int N){
	D.assign(N+1,inf);
	P.assign(N+1,-1);
	D[s]=0;
	P[s]=-1;
	set<pair<int, int>> Q;
	Q.insert({0,s});
	while(!Q.empty())
	{
		auto top=Q.begin();
		int u=top->second;
		Q.erase(top);
		if(u==N)return ;
		for(auto next:G[u])
		{
			int v=next.first,wt=next.second;
			if(D[v]>D[u]+wt)
			{
				P[v]=u;
				Q.erase({D[v], v});
				D[v]=D[u]+wt;
				Q.insert({D[v], v});
			}
		}
	}
}
void print_shortest_path(int to){
	vector<int> path;
	for(int i= to ; i!=-1; i=P[i])
	{
		path.push_back(i);
	}
	reverse(path.begin(),path.end());
	for(auto x :path)
	{
		cout << x << " ";
	}
}
int32_t main(){
	startt;
	freopen("dijkstra.in", "r", stdin);
	freopen("dijkstra.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	G = new vector<pair<int , int>> [n+1];
	for(int i=0;i < m; i++)
	{
		int a,b,w;
		cin>>a>>b>>w;
		G[a].push_back({b,w});
		G[b].push_back({a,w});
	}
	Dijkstra(1,n);
	for(int i = 2; i <= n; i++)
	{
		if(D[i] == inf)
		{
			cout << 0 << " ";
			continue;
		}
		cout << D[i] << " ";
	}
}