#include <bits/stdc++.h>
#define NMax 50005
#define INF 999999
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int N,M;
int Dist[NMax];
vector<pair<int,int> > Graf[NMax];
priority_queue<pair<int,int>, vector<pair<int,int> >,greater<pair<int,int> > > Queue;
void Read()
{
fin>>N>>M;
for(int i=1;i<=M;i++)
{
int from,to,cost;
fin>>from>>to>>cost;
Graf[from].push_back(make_pair(to,cost));
}
}
void Write()
{
for(int i=2;i<=N;i++)
if(Dist[i]>INF)
fout<<"0 ";
else
fout<<Dist[i]<<" ";
}
void Dijkstra(int source)
{
memset(Dist,INF,sizeof(Dist));
Dist[source]=0;
Queue.push(make_pair(source,Dist[source]));
while(!Queue.empty())
{
int nod=Queue.top().first;
int d=Queue.top().second;
Queue.pop();
if(Dist[nod]!=d)
continue;
for(vector<pair<int,int> >::iterator it=Graf[nod].begin();it!=Graf[nod].end();it++)
{
int to=it->first;
int cost=it->second;
if(Dist[to]>Dist[nod]+cost)
{
Dist[to]=Dist[nod]+cost;
Queue.push(make_pair(to,Dist[to]));
}
}
}
}
int main()
{
Read();
Dijkstra(1);
Write();
return 0;
}