#include <fstream>
#include <vector>
#define N 50010
#define PI pair<int, int>
#define nod first
#define cost second
#define INF 999999999

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

vector<PI> A[N];
int n,m,i,j,ANS[N],a,b,c;

int main ()
{
    f >> n >> m;
    for (i=1; i<=n; i++)
        ANS[i]=INF;
    for (i=1; i<=m; i++)
    {
        f >> a >> b >> c;
        A[a].push_back(make_pair(b,c));
    }
    ANS[1]=0;
    for (i=1;i<=n;i++)
    {
       for (j=0;j<A[i].size();j++)
            if (A[i][j].nod>i && ANS[A[i][j].nod]>ANS[i]+A[i][j].cost)
                ANS[A[i][j].nod]=ANS[i]+A[i][j].cost;
    }
    for (i=n;i>=1;i--)
    {
       for (j=0;j<A[i].size();j++)
            if (A[i][j].nod<i && ANS[A[i][j].nod]>ANS[i]+A[i][j].cost)
                ANS[A[i][j].nod]=ANS[i]+A[i][j].cost;
    }



    for (i=2; i<=n; i++)
        g << (ANS[i]<INF?ANS[i]:0) << ' ';
    g << '\n';
    f.close();
    g.close();
    return 0;
}