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