#include <fstream>
#include <vector>
#include <set>
#define INF 100000000
using namespace std;

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

int main()
{
    int n, m;
    in >> n >> m;

    vector<pair<int,int>> v[n+1];

    for(int i = 0; i < m; i++)
    {
        int x, y, c;
        in >> x >> y >> c;

        v[x].push_back({y,c});
    }

    vector<int> d(n+1,INF);
    d[1] = 0;

    vector<bool> vis(n+1,false);
    set<pair<int,int>> s;
    s.insert({0,1});

    while(!s.empty())
    {
        auto it = s.begin();
        int nod = it->second;

        s.erase(it);

        for(size_t i = 0; i < v[nod].size(); i++)
        {
            int act = v[nod][i].first;
            int cost = v[nod][i].second;

            if(d[nod]+cost < d[act])
            {
                d[act] = d[nod]+cost;

                if(!vis[act])
                {
                    d[act] = min(d[act],d[nod]+cost);
                    s.insert({d[act],act});
                }
            }
        }

        vis[nod] = true;
    }

    for(int i = 2; i <= n; i++) out << (d[i] == INF ? 0 : d[i]) << ' ';

    return 0;
}