#include <fstream>
#include<vector>
#include<queue>
#include<utility>
using namespace std;
vector< vector <pair <int, int> > > graph;
vector <bool> v;
vector <int> d, p;
int n,m;
void dijkstra (int vertex)
{
    queue <int> q;
    int element;
    q.push(vertex);
    while(!q.empty())
    {
        element=q.front();
        v[vertex]=false;
        for(int i=0;i<graph[element].size();i++)
        {
            if(d[element]+graph[element][i].second<d[graph[element][i].first])
            {
                d[graph[element][i].first]=d[element]+graph[element][i].second;
                p[graph[element][i].first]=element;
                if(!v[graph[element][i].first])
                {
                    q.push(graph[element][i].first);
                    v[graph[element][i].first]=true;
                }
            }
        }
    q.pop();
    }
}
int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    f>>n>>m;
    graph.resize(n);
    v.resize(n, false);
    d.resize(n,250001);
    p.resize(n, 0);
    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));
    }
    v[0]=true;
    d[0]=0;
    dijkstra(0);
    for(int i=1;i<n;i++)
    {
        g<<d[i]<<" ";
    }
    f.close();
    g.close();
    return 0;
}