#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int Nmax=5000+5,Mmax=250000+5;
const int INF=0x3f3f3f3f;
int n,m,nod;
int a[Nmax][Nmax];
bool ok=0;
vector<int>v;
bool parc[Nmax];
int DP[Nmax];
int minim,minimi;
void BF()
{
    minim=INF;
    if(ok==1)return;
    for(auto i : v)
    {
        if(parc[i]==0)
        {
            if(DP[i]<minim or DP[i]==INF)
            {
                minim=DP[i];
                minimi=i;
            }
        }
    }
    nod=minimi;
    for(int i=1;i<=n;++i)
    {
        if(a[nod][i]!=INF)
        {
            if(DP[i]>DP[nod]+a[nod][i])
            {
                DP[i]=DP[nod]+a[nod][i];
                if(i==n)
                    ok=1;
                v.push_back(i);
            }
        }
    }
    parc[nod]=1;
    BF();
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            a[i][j]=INF;
    for(int i=1,x,y,c;i<=m;++i)
    {
        fin>>x>>y>>c;
        a[x][y]=c;
    }
    for(int i=0;i<=n;++i)DP[i]=INF;
    DP[1]=0;nod=1;
    v.push_back(1);
    //for(int i=0;i<v.size();++i)cout<<v[i]<<" ";
    BF();
    for(int i=2;i<=n;++i)fout<<DP[i]<<" ";
    return 0;
}