#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
#define INF 9999999
struct rct
{
    int nod, cost;
}act,urm;
vector<rct> graf[50001];
queue<rct> coada;
int n,m,i,j,x,y,z,nod;
int d[50001];
int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y>>z;
        act.nod=y; act.cost=z;
        graf[x].push_back(act);
    }
    for(i=1; i<=n; i++)
        d[i]=INF;
    d[1]=0;
    act.nod=1; act.cost=0;
    coada.push(act);
    while(!coada.empty())
    {
        nod=coada.front().nod; coada.pop();
        for(i=0; i<graf[nod].size(); i++)
        {
            if(d[nod]+graf[nod][i].cost < d[graf[nod][i].nod])
            {
                d[graf[nod][i].nod] = d[nod]+ graf[nod][i].cost;
                urm.nod=graf[nod][i].nod; urm.cost=graf[nod][i].cost;
                coada.push(urm);
            }
        }
    }
    for(i=2; i<=n; i++)
    {
        if(d[i]==INF)
            cout<<"0 ";
        else
            cout<<d[i]<<" ";
    }
}