#include<iostream>
#include<fstream>
#include<vector>
#include<queue>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

#define nrm 50010
const int oo=(1<<31)-1;
int n,m;
vector< pair<int,int> > graf[nrm];
int dist[nrm];
bool viz[nrm];
struct comparare
{
    bool operator()(int x,int y)
    {
        return dist[x]>dist[y];
    }
};
priority_queue<int,vector<int>,comparare> coada;

void citire()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,cost;
        fin>>x>>y>>cost;
        graf[x].push_back(make_pair(y,cost));
    }
}

void dijkstra(int k)
{
    viz[k]=1;
    coada.push(k);
    while(!coada.empty())
    {
        int nod=coada.top();
        coada.pop();
        viz[nod]=0;
        for(int i=0;i<graf[nod].size();i++)
        {
            int vecin=graf[nod][i].first;
            int cost=graf[nod][i].second;
            if(dist[nod]+cost<dist[vecin])
            {
                dist[vecin]=dist[nod]+cost;
                if(viz[vecin]==0)
                {
                    coada.push(vecin);
                    viz[vecin]=1;
                }
            }
        }
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(dist[i]!=oo)
            fout<<dist[i]<<" ";
        else
            fout<<0<<" ";
    }
}

int main ()
{
    citire();
    for(int i=1;i<=n;i++)
    {
        dist[i]=oo;
    }
    dist[1]=0;
    dijkstra(1);
    afisare();
    fin.close();
    fout.close();
    return 0;
}