#include<iostream>
#include<fstream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;

struct coord
{
    int cost,nod;

};

vector <coord> v[50005];
int n,m,viz[50005];
coord q[500005];

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


inline void Citire()
{
    int i,x;
    coord y;
    fin>>n>>m;
    for (i=1;i<=m;i++)
        {
            fin>>x>>y.nod>>y.cost;
            v[x].push_back(y);
        }
}

inline void LeeIG()
{
    int pr,ul,len,j;
    coord k;
    pr=ul=1;
    q[pr].cost=0;
    q[pr].nod=1;
    while (pr<=ul)
        {
            k=q[pr];pr++;len=v[k.nod].size();
            for (j=0;j<len;j++)
                if (viz[v[k.nod][j].nod]==0 || k.cost+v[k.nod][j].cost<viz[v[k.nod][j].nod])
                    {
                        ul++;
                        q[ul].nod=v[k.nod][j].nod;
                        q[ul].cost=k.cost+v[k.nod][j].cost;
                        viz[v[k.nod][j].nod]=q[ul].cost;
                    }

        }
}

inline void Afisare()
{
    int i;
    for (i=2;i<=n;i++)
        fout<<viz[i]<<" ";
    fout<<"\n";
}

int main()
{
    Citire();
    LeeIG();
    Afisare();
    return 0;
}