#include <fstream>
#include <queue>
#include <climits>
#include <vector>
#define DIM 50001

using namespace std;

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

int n,m,x,y,cost;
int d[DIM];
bool viz[DIM];
vector<pair<int, int>>L[DIM];
int minim,p;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        L[x].push_back(make_pair(y,cost));
    }
    for(int i=2;i<=n;i++)
        d[i]=INT_MAX;
    for(int i=1;i<=n;i++)
    {
        ///determin nodul nevizitat care are in d valoare minima
        minim=INT_MAX;
        p=0;
        for(int j=1;j<=n;j++)
        {
            if(minim>d[j] && viz[j]==0)
            {
                minim=d[j];
                p=j;
            }
        }
        viz[p]=1;
        ///actualizam distantele de la nodul p la nodurile adiacente cu p
        for(auto vec: L[p])
        {
            int nod=vec.first, cost=vec.second;
            if(d[nod]>d[p]+cost)
                d[nod]=d[p]+cost;
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==INT_MAX)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}