#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
FILE*in=fopen("dijkstra.in","r");
FILE*out=fopen("dijkstra.out","w");
const int NMAX=50007;
int n,m,i,j,x,y,c,dij[NMAX];
bool b[NMAX];
struct edge
{
    int nod,cost;
};
edge ed;
vector<edge> adj[NMAX];
struct pct
{
    int nod,cost;
};
pct f,g;
priority_queue<pct> pq;
inline bool operator<(pct a, pct b)
{
    return a.cost>b.cost;
}
void dijkstra()
{
    while(!pq.empty())
    {
        f=pq.top();
        pq.pop();
        if(b[f.nod]==1)
        {
            continue;
        }
        b[f.nod]=1;
        dij[f.nod]=f.cost;
        for(auto w:adj[f.nod])
        {
            g.nod=w.nod;
            g.cost=dij[f.nod]+w.cost;
            pq.push(g);
        }
    }
}
int main()
{
    fscanf(in,"%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(in,"%d%d%d",&x,&y,&c);
        ed.nod=y;
        ed.cost=c;
        adj[x].push_back(ed);
    }
    dij[1]=0;
    f.nod=1;
    f.cost=0;
    pq.push(f);
    dijkstra();
    for(i=2;i<=n;i++)
    {
        fprintf(out,"%d ",dij[i]);
    }
}