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

using namespace std;

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

const int Nmax = 50005, INF = 2000000005;
int dist[Nmax];
vector<pair<int, int> > L[Nmax];
priority_queue<pair<int, int> > q;

void dijkstra(){
    int nr,nod;
    while(!q.empty()){
        nr = q.top().first;
        nod = q.top().second;
        if(-nr<dist[nod])
            dist[nod] = -nr;
        q.pop();
        for(pair<int, int> vec : L[nod]){
            if(dist[vec.first] == INF)
                q.push({nr-vec.second, vec.first});
        }
    }
}

int main()
{
    int n,m,i;
    fin >> n >> m;
    for(i=1;i<=m;i++){
        int x,y,z;
        fin >> x >> y >> z;
        L[x].push_back({y, z});
    }
    for(i=1;i<=n;i++)
        dist[i] = INF;
    q.push({0, 1});
    dijkstra();
    for(i=2;i<=n;i++){
        if(dist[i] == INF)
            fout << "0 ";
        else
            fout << dist[i] << " ";
    }
    return 0;
}