#include <bits/stdc++.h>
#define oo 999999999
#define NMAX 50010

using namespace std;

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

int dist[NMAX], n, m, x, y, w;
bitset<NMAX> viz;
priority_queue<pair<int, int> > pq;
pair<int, int> top;
vector<pair<int, int> > v[NMAX];


int main()
{
    int nod, dst;
    fin >> n >> m;
    while(m--)
    {
        fin >> x >> y >> w;
        v[x].push_back(make_pair(w, y));
    }
    for(int i=1; i<=n; i++)
        dist[i] = oo;
    dist[1] = 0;
    pq.push(make_pair(0, 1));
    while(!pq.empty())
    {
        top = pq.top();
        pq.pop();
        if(viz[top.second])
            continue;
        viz[top.second] = 1;
        nod = top.second;
        dst = -top.first;
        for(auto vec:v[nod])
        {
            if(dist[vec.second] > dst + vec.first)
            {
                dist[vec.second] = dst + vec.first;
                pq.push(make_pair(-dist[vec.second], vec.second));
            }
        }
    }

    for(int i=2; i<=n; i++)
    {
        if(dist[i] == oo)
            fout << 0 << ' ';
        else
            fout << dist[i] << ' ';
    }
    fout << '\n';


    return 0;
}