#include <fstream>
#include <deque>
#include <vector>
#define CMAX 100000100

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct nod
{
    int v,cost;
};
int n,m,x,y,c;
vector <nod> d[50001];
deque <nod> h;
bool viz[50001];
int cost[50001],tata[50001];
void updateHeap(int dim)
{
    int j=dim;
    while(j/2>=1)
        if(h[j].cost<h[j/2].cost)
        {
            swap(h[j/2],h[j]);
            j/=2;
        }
        else
            break;
}
void deleteElemHeap(int dim)
{
    int j=1,j2;
    while(j*2<=dim)
    {
        j2=j*2;
        if(h[j2].cost<h[j].cost)
            j=j2;
        if(j2+1<=dim && h[j2+1].cost<h[j].cost)
            j=j2+1;
        if(j==j2/2)
            break;
        else
            swap(h[j2/2],h[j]);
    }
}
void Dijkstra(int p)
{
    int k=1;
    h.push_front({p,0});
    h.push_front({-1,-1});
    while(k)
    {
        nod i=h[1];
        swap(h[1],h.back());
        h.pop_back();
        k--;
        deleteElemHeap(k);
        if(!viz[i.v])
            for(vector <nod>::iterator it=d[i.v].begin(); it!=d[i.v].end(); it++)
                if(it->cost+cost[i.v]<cost[it->v])
                {
                    cost[it->v]=it->cost+cost[i.v];
                    tata[it->v]=i.v;
                    h.push_back({it->v,cost[it->v]});
                    k++;
                    updateHeap(k);
                }
        viz[i.v]=1;
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        d[x].push_back({y,c});
        d[y].push_back({x,c});
    }
    for(int i=2; i<=n; i++)
        cost[i]=CMAX;
    tata[1]=-1;
    Dijkstra(1);
    for(int i=2; i<=n; i++)
        if(cost[i]==CMAX)
            fout<<0<<' ';
        else
            fout<<cost[i]<<' ';
    return 0;
}