#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define Nmax 50005
#define oo (1<<30)
using namespace std;
int n,m,d[Nmax];
bool v[Nmax];
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
vector <pair<int,int> > G[Nmax];
struct compara
{
    bool operator() (int x,int y)
    {
        return d[x]>d[y];
    }
};
priority_queue <int,vector<int>,compara> q;
void citire()
{
    int i,x,y,c;
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
}
void Dijkstra (int nodStart)
{
    int i;
    for (i=1;i<=n;i++)
        d[i]=oo;
    d[nodStart]=0;
    q.push(nodStart);
    v[nodStart]=true;
    while (!q.empty())
    {
        int nodCurent=q.top();
        q.pop();
        v[nodCurent]=false;
        for (size_t i=0;i<G[nodCurent].size();i++)
        {
            int vecin=G[nodCurent][i].first;
            int cost=G[nodCurent][i].second;
            if (d[nodCurent]+cost<d[vecin])
            {
                d[vecin]=d[nodCurent]+cost;
                if (v[vecin]==false)
                {
                    q.push(vecin);
                    v[vecin]=true;
                }
            }
        }
    }
}
void afiseaza ()
{
    int i;
    for (i=2;i<=n;i++)
        if (d[i]!=oo)
            fout<<d[i]<<" ";
        else fout<<"0 ";
    fout<<"\n";
}
int main()
{
    citire();
    Dijkstra(1);
    afiseaza();
    return 0;
}