#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
#define INF 99999999
struct rct
{
    int nod,cost;
}aux,crt,urm;
class comp
{
    public:
    bool operator()(rct A, rct B)
    {
        return A.cost>B.cost;
    }
};
vector<rct> graf[50001];
priority_queue<rct,vector<rct>,comp> 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;
        aux.nod=y; aux.cost=z;
        graf[x].push_back(aux);
    }
    for(i=1; i<=n; i++)
        d[i]=INF;

    d[1]=0;
    crt.nod=1; crt.cost=0; coada.push(crt);
    while(!coada.empty())
    {
        crt=coada.top();
        nod=coada.top().nod;
        coada.pop();
        if(d[nod]!=crt.cost)
            continue;

        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=d[graf[nod][i].nod];
                coada.push(urm);
            }
        }
    }
    for(i=2; i<=n; i++)
    {
        if(!d[i])
            cout<<"0 ";
        else
            cout<<d[i]<<" ";
    }
}