#include <bits/stdc++.h>

using namespace std;

const int INF = 0x3f3f3f3f;
const int N_MAX = 50002;

template < typename T >
class heap : public priority_queue < T, vector < T > >
{
    public:
    bool erase(const T& value)
    {
        auto it = find(this->c.begin(), this->c.end(), value);
        if (it != this->c.end())
        {
            this->c.erase(it);
            make_heap(this->c.begin(), this->c.end(), this->comp);
            return true;
        }
        return false;
    }
};

heap < pair < int , int > > s;
vector < pair < int , int > > v[N_MAX];

int d[N_MAX];

int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    int n, m; f >> n >> m;
    for(int i = 1, x, y, c; i <= m; i++)
    {
        f >> x >> y >> c;
        v[x].push_back({y, c});
    }

    memset(d, INF, sizeof(d));
    d[1] = 0;
    for(int i = 1; i <= n; i++)
        s.push({d[i], i});

    while(!s.empty())
    {
        int x = s.top().second;
        s.pop();

        for(int i = 0; i < v[x].size(); i++)
        {
            int y = v[x][i].first, c = v[x][i].second;

            if(d[x] + c < d[y])
            {
                s.erase({d[y], y});

                d[y] = d[x] + c;
                s.push({d[y], y});
            }
        }
    }

    for(int i = 2; i <= n; i++)
    {
        if(d[i] == INF)
            d[i] = 0;
        g << d[i] << " ";
    }
    g << '\n';
    f.close();
    g.close();
    return 0;
}