#include <fstream>
#include <vector>
#include <set>
#define inf 1000000000
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
int n,m,i,x,nod,y,c,vecin,cost,d[50002];
set <pair <int,int>> s;
vector <pair <int,int>>v[50002];
int main()
{
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        v[x].push_back ({y,c});
    }
    d[1]=0;
    for (i=2; i<=n; i++)
        d[i]=inf;
    s.insert (make_pair(0,1));
    while (!s.empty ())
    {
        nod=s.begin ()->second;
        s.erase (s.begin ());
        for (i=0; i<v[nod].size (); i++)
        {
            vecin=v[nod][i].first;
            cost=v[nod][i].second;
            if (d[vecin]>d[nod]+cost)
            {
                s.erase (make_pair (d[vecin],vecin));
                d[vecin]=d[nod]+cost;
                s.insert (make_pair (d[vecin],vecin));
            }
        }
    }
    for (i=2; i<=n; i++)
    {
        if (d[i]==inf)
            fout<<"0 ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}