#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n,m,i,inf=1<<29,d[50001],viz[50001],x,y,c;
vector < pair <int,int> > v[50001];
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
void minim(int &k)
{
    int i,mini=2*inf;
    for(i=1;i<=n;i++)
        if(d[i]<mini&&viz[i]==0)
    {
        mini=d[i];
        k=i;
    }
}
void dijkstra()
{
    int nr,k,OK;
    x=1;
    viz[x]=1;nr=1;
    while(nr<n)
    {
        minim(k);

            viz[k]=1;nr++;
            for(i=0;i<v[k].size();i++)
                if(viz[v[k][i].first]==0&&d[v[k][i].first]>d[k]+v[k][i].second)
            {
                d[v[k][i].first]=d[k]+v[k][i].second;
            }

    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(i=1;i<=n;i++)
        d[i]=inf;
    for(i=0;i<v[1].size();i++)
    {
        d[v[1][i].first]=v[1][i].second;
    }
    dijkstra();
    for(i=2;i<=n;i++)
    {
        if(d[i]==inf)g<<0<<" ";
        else
            g<<d[i]<<" ";
    }
    return 0;
}