#include <fstream>
#include<vector>
#include<queue>
#include<utility>
#include<algorithm>
using namespace std;
vector< vector <pair <int, int> > > graph;
vector <int> d;
vector <pair<int, int> > heap;
struct {
        bool operator()(pair<int, int> lhs, pair<int, int> rhs) const {
            return lhs.second > rhs.second;
        }
    } Compare;
void dijkstra(int nod)
{
    make_heap(heap.begin(), heap.end(), Compare);
    while(!heap.empty())
   {
       for(int i=0;i<graph[nod].size();i++)
    {
        if(d[graph[nod][i].first]>d[nod]+graph[nod][i].second)
        {
            d[graph[nod][i].first]=d[nod]+graph[nod][i].second;
            heap.push_back(make_pair(graph[nod][i].first,d[nod]+graph[nod][i].second));
            push_heap(heap.begin(), heap.end(),Compare);
        }
    }
    pop_heap(heap.begin(),heap.end(),Compare);
    heap.pop_back();
    nod=heap.front().first;
   }
}
int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    int n,m;
    f>>n>>m;
    graph.resize(n);
    d.resize(n,250001);
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        f>>x>>y>>c;
        x--;
        y--;
        graph[x].push_back(make_pair(y,c));
    }
    d[0]=0;
    heap.push_back(make_pair(0,0));
    dijkstra(0);
    for(int i=1;i<n;i++)
        if(d[i]!=250001)
        g<<d[i]<<" ";
    else
        g<<"0 ";
    return 0;
}