#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
const int INF = 1e9;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
void dijkstra(int s, vector<vector<pair<int, int>>> &L, vector<int> &D, vector<int> &vis, priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq)
{
D[s] = 0;
pq.push({D[s], s});
while (!pq.empty())
{
int nod = pq.top().second;
pq.pop();
if (vis[nod] == 1)
continue;
vis[nod] = 1;
for (auto it : L[nod])
{
int vec = it.first;
int cost = it.second;
if (D[vec] > D[nod] + cost)
{
D[vec] = D[nod] + cost;
pq.push({D[vec], vec});
}
}
}
}
int main()
{
int n, m;
fin >> n >> m;
vector<vector<pair<int, int>>> L(n + 1);
for (int i = 0; i < m; i++)
{
int a, b, cost;
fin >> a >> b >> cost;
L[a].push_back({b, cost});
}
vector<int> D(n + 1, INF), vis(n + 1, 0);
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
dijkstra(1, L, D, vis, pq);
for (int i = 2; i <= n; i++)
{
if (D[i] == INF)
fout << 0 << " ";
else
fout << D[i] << " ";
}
fout << "\n";
return 0;
}