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

    act.nod=1; act.cost=0; d[1]=0;
    coada.push(act);
    while(!coada.empty())
    {
        crt=coada.top().nod;
        if(d[crt]!=coada.top().cost)
        {
            coada.pop();
            continue;
        }
        coada.pop();
        for(i=0; i<graf[crt].size(); i++)
        {
            if(d[crt] + graf[crt][i].cost < d[graf[crt][i].nod])
               {
                    d[graf[crt][i].nod]=d[crt]+graf[crt][i].cost;
                    act.nod=graf[crt][i].nod;
                    act.cost=d[graf[crt][i].nod];
                    coada.push(act);
               }
        }
    }
    for(i=2; i<=n; i++)
        if(d[i]==INF)
            cout<<"0 ";
        else
            cout<<d[i]<<" ";
}