#include <fstream>
#include <vector>
#include <set>
#define inf 0x3f3f3f3f
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

vector<pair<int, int>> v[50001];
set<pair<int, int>> s;
set<pair<int, int>>::iterator it, it1;
int d[50001], rez[50001];

int main()
{
    int n, m, a, b, c, i;
    in >> n >> m;
    for (i = 2; i <= n; i++)
        d[i] = inf;
    for (i = 1; i <= m; i++)
    {
        in >> a >> b >> c;
        v[a].push_back(make_pair(c, b));
        if (a == 1)
        {
            d[b] = c;
            s.insert(make_pair(c, b));
        }
    }
    while (!s.empty())
    {
        it1 = s.begin();
        int nod = (*it1).second, mini = (*it1).first;
        for (i = 0; i < v[nod].size(); i++)
        {
            if (d[v[nod][i].second] > mini + v[nod][i].first)
            {
                pair<int, int> vecin;
                vecin.first = d[v[nod][i].second];
                vecin.second = v[nod][i].second;
                it = s.find(vecin);
                if (it == s.end())
                {
                    vecin.first = mini + v[nod][i].first;
                    s.insert(vecin);
                    d[vecin.second] = vecin.first;
                }
                else
                {
                    s.erase(it);
                    vecin.first = mini + v[nod][i].first;
                    s.insert(vecin);
                    d[vecin.second] = vecin.first;
                }
            }
        }
        s.erase(it1);
    }
    for (i = 2; i <= n; i++)
    {
        if (d[i] != inf)
            out << d[i] << " ";
        else
            out << 0 << " ";
    }
    return 0;
}