#include <fstream>
#include <climits>
#include <vector>
#define X first
#define Y second
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,i,j,x,y,z,f[50010],minim,D[50010],p;
vector< pair<int,int> > L[50010];
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>z;
        L[x].push_back(make_pair(y,z));
    }
    D[1]=0;
    for(i=2;i<=n;i++)
        D[i]=INT_MAX;
    for(;;){
        minim=INT_MAX;
        for(i=1;i<=n;i++)
            if(f[i]==0&&D[i]<minim){
                minim=D[i];
                p=i;
            }
        if(minim==INT_MAX)
            break;
        f[p]=1;
        for(i=0;i<L[p].size();i++){
            int vec=L[p][i].X;
            if(D[vec]>D[p]+L[p][i].Y)
                D[vec]=D[p]+L[p][i].Y;
        }
    }
    for(i=2;i<=n;i++)
        if(D[i]==INT_MAX)
            fout<<"0 ";
        else
            fout<<D[i]<<" ";
    return 0;
}