#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#define NMAX 50001
#define MMAX 250001
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int i,j,x,d[NMAX],tata[NMAX],viz[NMAX],min1,r,k,noduri,n,m,y,c;
vector <int> T[MMAX],C[MMAX];
void dj()
{
    viz[1]=1;
    for(j=1;j<n+1;j++)
    {
        min1=INF;
        for(i=1;i<n+1;i++)
               if(d[i]<min1&&viz[i]==0) {min1=d[i];k=i;}
         viz[k]=1;
        i=0;
        for(i=0;i<T[k].size();i++)
            {
            if(viz[T[k][i]]==0&&d[k]+C[k][i]<d[T[k][i]])
                    { d[T[k][i]]=d[k]+C[k][i]; tata[T[k][i]]=k; }
            }

    }
}
int main()
{
    fin>>n>>m;
    for(i=1;i<n+1;i++)
        d[i]=INF;
    for(i=1;i<m+1;i++)
    {
        fin>>x;
        fin>>y;
        fin>>c;
        T[x].push_back(y);
        C[x].push_back(c);
        if(x==1) {d[y]=c;}
    }
    dj();
    for(i=2;i<n+1;i++)
        if(d[i]==INF) fout<<"0 ";
                    else fout<<d[i]<<" ";
    fin.close();
    fout.close();
    return 0;
}