#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
const int nmax=1005,inf=1000005;
int n,m,dist[nmax];
bool inCoada[nmax];
struct cmp
{
bool operator()(int x,int y)
{
return dist[x]>dist[y];
}
};
vector <pair<int,int>> muchii[nmax];
priority_queue <int,vector<int>,cmp> q;
void dijkstra(int nod)
{
while (!q.empty())
{
int nod=q.top();
q.pop();
inCoada[nod]=false;
for (int i=0;i<muchii[nod].size();i++)
{
int vecin=muchii[nod][i].first;
int cost=muchii[nod][i].second;
if (dist[nod]+cost<dist[vecin])
{
dist[vecin]=dist[nod]+cost;
if (!inCoada[vecin])
{
q.push(vecin);
inCoada[vecin]=true;
}
}
}
}
}
int main()
{
fin >> n >> m;
for (int i=1;i<=m;i++)
{
int x,y,c;
fin >> x >> y >> c;
muchii[x].push_back(make_pair(y,c));
muchii[y].push_back(make_pair(x,c));
}
for (int i=1;i<=n;i++)
{
dist[i]=inf;
inCoada[i]=false;
}
dist[1]=0;
q.push(1);
inCoada[1]=true;
dijkstra(1);
for (int i=2;i<=n;i++)
{
if (dist[i]!=inf) fout << dist[i] << " ";
else fout << 0 << " ";
}
}