#include <fstream>
#include <vector>
#include <climits>
using namespace std;
int n, m, x, y, dist, d[50001], Min, nod, cost, p, i, j;
vector < pair <int, int> > g[50001];
bool viz[50001];
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");

int main () {
    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y>>dist;
        g[x].push_back({y, dist});
    }

    ///d[i]=distanta de la 1 la nodul i

    d[1]=0;
    for (i=2;i<=n;i++) {
        d[i]=INT_MAX;
    }
    for (i=1;i<n;i++) {
        Min=INT_MAX; p=0;
        for (j=1;j<=n;j++) {
            if (viz[j]==0 && d[j]<Min) {
                Min=d[j];
                p=j;
            }
        }
        viz[p]=1;
        for (j=0;j<g[p].size();j++) {
            nod=g[p][j].first;
            cost=g[p][j].second;
            if (d[nod]>d[p]+cost) {
                d[nod]=d[p]+cost;
            }
        }
    }
    for (i=2;i<=n;i++) {
        if (d[i]!=INT_MAX) {
            fout<<d[i]<<" ";
        } else
            fout<<0<<" ";
    }
    return 0;
}