#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
#define INF 2000000000
#define cout g
int nr,n,m,a[5001][5001],res[50000],lista[1000000];
int i;
void BFS(int X)
{

    nr=1;
    int NOD,j,i;
    lista[nr]=X;
    for(j=1;j<=nr;++j)
    {
        NOD=lista[j];

        for(i=1;i<=n;++i)
        if(a[NOD][i]!=0)
        {

            if(res[i]>res[NOD]+a[NOD][i])
            {
            nr++;
            lista[nr]=i;
            res[i]=res[NOD]+a[NOD][i];
            }
        }
    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=n;++i) res[i]=INF;
    res[1]=0;
    for(i=1;i<=m;++i)
    {
        int x,y,z;
        f>>x>>y>>z;
        a[x][y]=z;
    }

    BFS(1);
    for(i=2;i<=n;++i)
    {
    if(res[i]==INF) cout<<0<<" ";
        else cout<<res[i]<<" ";
    }
    return 0;
}