#include <fstream>
#include <vector>
#include <queue>
#define INF 20001
using namespace std;

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

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

    vector<int> v[n+1];
    vector<vector<int>> l(n+1,vector<int>(n+1));

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

        l[x][y] = c;
        v[x].push_back(y);
    }

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

    auto mycomp = [&](int &a, int &b) -> bool
    {
            return d[a] > d[b];
    };

    vector<bool> vis(n+1,false);
    priority_queue<int,vector<int>,decltype(mycomp)> pq(mycomp);
    pq.push(1);

    while(!pq.empty())
    {
        int nod = pq.top();
        pq.pop();

        for(auto it: v[nod])
            if(!vis[it])
            {
                d[it] = min(d[it],d[nod]+l[nod][it]);
                pq.push(it);
            }

        vis[nod] = true;
    }

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

    return 0;
}