// Made by Alex Prohnitchi

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

typedef long long ll;

const ll mod=1e9+7;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define PI 3.14159265358979

using namespace std;

ll t;

vector<pair<int,int>>v[50003];
int rez[50003];
bool viz[50003];
void solve() {	
	ifstream cin("dijkstra.in");
	ofstream cout("dijkstra.out");
	ll n,m;
	cin >> n >> m;
	ll a,b,c;
	for (int i=1; i<=m; i++) {
		cin >> a >> b >> c;
		v[a].pb({b,c});
	}
	for(int i=0; i<=n; i++)rez[i]=200000;
	priority_queue<pair<int,int>>q;
	q.push({0,1});
	rez[1]=0;
	while (!q.empty()) {
		int nod=q.top().sc;
		q.pop();
		if (viz[nod])continue;
		viz[nod]=1;
		for (auto it:v[nod]) {
			int cost=rez[nod]+it.sc;
		//	cout << cost << " " << it.fr << endl;
			if (cost<rez[it.fr]) {
				rez[it.fr]=cost;
				q.push({-cost,it.fr});
			}
		}
	}
	for (int i=2; i<=n; i++) {
		if (rez[i]==200000)cout << "0 ";
		else cout << rez[i] << " ";
	}
}

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	t=1;
	while (t--) {
		solve();
	}

}