#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;
void printQueue(priority_queue<pair<int,int>> q)
{
	while (!q.empty()){
		cout << q.top().fr << " ";
		q.pop();
	}
	cout<<endl;
}
vector<pair<int,int>>ad[N];
int viz[N]={0},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;
	priority_queue<pair<int,int>>q;
	q.push({0,1});
	while (!q.empty()) {
			int nod=q.top().sc;
			//printQueue(q);
			q.pop();
			if (viz[nod])continue;
			viz[nod]=1;
			for (auto it:ad[nod]) {
			//	cout << it.fr << " " << q.top().fr << q.top().sc << "\n";
				int cost=rez[nod]+it.sc;
				//cout << nod << " " << rez[nod] << " " << cost << " " << it.fr << '\n';
				if (cost<rez[it.fr]) {
					q.push({-cost,it.fr});
					rez[it.fr]=cost;
				}
			}	
	}
	for (int i=2; i<=n; i++) {
		if (rez[i]==200000)cout << "0 ";
		else cout << rez[i] << " ";
	}
	
}

/*
8 7
6 5 1
1 3 2
4 5 3
1 5 8
3 5 3
4 6 1
1 4 1

*/