#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};
const int N=50003;
#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,n;

vector<pair<int,int>>ad[N];
int viz[N],rez[N];
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	ifstream cin("dijkstra.in");
	ofstream cout("dijkstra.out");
	int n,m;
	cin >> n >> m;
	int a,b,c;
	for (int i=1; i<=m; i++) {
		cin >> a >> b >> c;
		ad[a].pb({b,c});
	}
	for (int i=1; i<=n; i++) {
		rez[i]=200000;
	}
	rez[1]=0;
	queue<pair<int,int>>q;
	q.push({1,0});
	while (!q.empty()) {
		int nod=q.front().fr;
		if (!viz[nod]) {
			viz[nod]=1;
			for (auto it:ad[nod]) {
				q.push({it.fr,it.sc});
				rez[it.fr]=min(rez[it.fr],rez[nod]+it.sc);
			}
		}
		q.pop();
	}
	for (int i=2; i<=n; i++) {
		cout << rez[i] << " ";
	}
	
}