#include <bits/stdc++.h>
#define MAX 50100
#define INF 999999999
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct nod
{
    int x,cost;
};
vector<nod>g[MAX];
inline bool operator<(nod a,nod b)
{
    return a.cost>b.cost;
}
priority_queue<nod>pq;
bool uz[MAX];
int d[MAX];
int n,m;
void dijkstra(int node);
int main()
{
    int i,x,y,z;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        g[x].push_back({y,z});
    }
    dijkstra(1);
    for(i=2; i<=n; i++)
        if(d[i]==INF)
            fout<<0<<' ';
        else
            fout<<d[i]<<' ';
    return 0;
}
void dijkstra(int node)
{
    int vecin,costt,nodcrt,i;
    for(i=0; i<MAX; i++)
        d[i]=INF;
    pq.push({node,0});
    d[node]=0;
    while(!pq.empty())
    {
        nodcrt=pq.top().x;
        costt=pq.top().cost;
        pq.pop();
        for(i=0; i<g[nodcrt].size(); i++)
            if(d[g[nodcrt][i].x]>costt+g[nodcrt][i].cost)
            {
                d[g[nodcrt][i].x]=costt+g[nodcrt][i].cost;
                    pq.push({g[nodcrt][i].x,d[g[nodcrt][i].x]});
            }
    }
}