#include <fstream>
#include <set>
#include <vector>
#define NMAX 50010
#define inf 1147483646
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n, m,x,y,wh, dist[NMAX];
vector < pair<int,int> > v[NMAX];

void DJ(int nod)
{
    for(int i = 1; i <= n; ++i)
        dist[i] = inf;
    dist[nod] = 0;
    set <pair <int, int > > Q;
    Q.insert({0,nod});
    while(!Q.empty())
    {
        pair<int,int > top = *(Q.begin());
        Q.erase(Q.begin());
        for(int i = 0; i < v[top.second].size(); ++i)
        {
            int vf = v[top.second][i].first;
            int cost = v[top.second][i].second;
            if(dist[vf] > dist[top.second] + cost)
            {
                if(dist[vf] != inf)
                    Q.erase(Q.find({dist[vf],vf}));
                dist[vf] = dist[top.second] + cost;
                Q.insert({dist[vf],vf});
            }
        }
    }
}
int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y >> wh;
        v[x].push_back({y,wh});
    }
    DJ(1);
    for(int i = 2; i <= n; ++i)
        g << dist[i] << ' ';
    f.close();
    g.close();
    return 0;
}