#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int a[10000][10000],inf=999999,n,p,x,y,c,m;

int d[50001];
int v[50001];

struct compareDistance {

    bool operator () (int x, int y) {
        return d[x]>d[y];
    }

};

priority_queue <int, vector <int>, compareDistance> q;


int dijkstra (int p) {

    for (int i=1; i<=n; i++) {
        d[i]=inf;
    }
    d[p]=0;
    v[p]=1;
    q.push(p);

    while (!q.empty()) {

        int poz = q.top();
        q.pop();

        for (int i=1; i<=n; i++) {
            if (i!=poz and v[i]==0 and (a[poz][i] + d[poz] < d[i])) {
                d[i]=a[poz][i] + d[poz];
                q.push(i);
            }
        }
    }

}

int main()
{
    fin>>n>>m;

    for (int i=1; i<=n; i++) {
        for (int j=1; j<=n; j++) {
            if (i==j) a[i][j]=0;
            else a[i][j]=inf;
        }
    }

    for (int i=1; i<=m; i++) {
        fin>>x>>y>>c;
        a[x][y]=c;
    }

    dijkstra(1);

//    fout<<"d: ";
    for (int i=2; i<=n; i++) {
        if (d[i]==inf) fout<<0<<" ";
        else fout<<d[i]<<" ";
    }
//    fout<<endl<<"s: ";
//    for (int i=1; i<=n; i++) {
//        fout<<s[i]<<" ";
//    }


    return 0;
}