#include <iostream>
#include <fstream>
#include <vector>
#define inf 1<<24
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int main()
{
    int n, m;
    f>>n>>m;
    vector <vector <pair <int, int> > > v(n+1);
    vector < int > viz(n+1,0), d(n+1,inf);
    d[1]=0;
    for (int i=1;i<=m;i++){
        int x,y,cost;
        f>>x>>y>>cost;
        v[x].push_back(make_pair(y,cost));
    }
    for (int i=1;i<=n;i++){
        int em=inf, pm;
        for (int j=1;j<=n;j++)
            if (d[j]<em && viz[j]==0)
            {
                em=d[j];
                pm=j;
            }
        viz[pm]=1;
        for (auto j:v[pm]){
            if (d[pm]+j.second<d[j.first])
                d[j.first]=d[pm]+j.second;
        }
    }
    for (int i=2;i<=n;i++)
        if (d[i]==inf)  g<<"0"<<' ';
        else    g<<d[i]<<' ';

    return 0;
}