#include <vector>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <queue>
#define inf 0x3f3f3f3f
#define NM 50005
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

vector < pair < int, int > > graf[NM];
priority_queue < pair < int, int > > q;
int n, m, d[NM], use[NM];

int main()
{
    int dist, x, y, c, nod;
    f >> n >> m;
    for(int i = 1; i <= n; ++i) d[i] = inf;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y >> c;
        graf[x].push_back(make_pair(y, c));
    }
    q.push({0, 1});
    d[1] = 0;
    while(!q.empty())
    {
        nod = q.top().second;
        q.pop();

        if(!use[nod])
        {
            use[nod] = 1;
            for(int i = 0; i < graf[nod].size(); ++i)
            {
                x = graf[nod][i].first;
                y = graf[nod][i].second;
                if(d[x] > d[nod] + y)
                {
                    d[x] = d[nod] + y;
                    q.push(make_pair(-d[x], x));
                }
            }
        }

    }

    for(int i = 2; i <= n; ++i)
    {
        if(d[i] != inf) g << d[i] << ' ';
        else g << "0" << ' ';
    }
}