#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair<int,int> > A[50001];
priority_queue <pair<int,int> > Q;
int n,m,D[50001];
bool viz[50001];
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        A[a].push_back({-c,b});
    }
    for(int i=2; i<=n; i++)
        D[i]=-2000000000;
    Q.push({0,1});
    while(!Q.empty())
    {
        int nod=Q.top().second;
        Q.pop();
        for(auto it:A[nod])
        {
            int cost=it.first;
            int dest=it.second;
            if(viz[dest]==0)
            {
                if(D[dest]<D[nod]+cost)
                {
                    D[dest]=D[nod]+cost;
                    Q.push({cost,dest});
                    viz[nod]=1;
                }
            }
        }

    }
    for(int i=2; i<=n; i++)
        fout<<-D[i]<<" ";
    return 0;
}