#include <fstream>
#include <vector>
#define inf 1000000000
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
int n,m,i,g,nod,vecin,cost,x,minc,y,c,d[50002],viz[50002];
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;
    for (g=1; g<=n; g++)
    {
        minc=inf;
        for (i=1; i<=n; i++)
        {
            if (viz[i]==0&&d[i]<minc)
            {
                minc=d[i];
                nod=i;
            }
        }
        if (minc==inf)
            break;
        viz[nod]=1;
        for (i=0; i<v[nod].size (); i++)
        {
            vecin=v[nod][i].first;
            cost=v[nod][i].second;
            if (d[vecin]>d[nod]+cost)
                d[vecin]=d[nod]+cost;
        }
    }
    for (i=2; i<=n; i++)
    {
        if (d[i]==inf)
            fout<<"0 ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}