#include <fstream>
#include <vector>
#include <set>

using namespace std;

#define INF 100000

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

int main()
{
    int n,m;
    in>>n>>m;
    vector<vector<pair<int,int>>> Graf(n+1);
    vector<int> dist(n+1,INF);
    set<pair<int,int>> viz;

    dist[0]=0;

    for(int i=0;i<m;i++)
    {
        int x, y, cost;
        in>>x>>y>>cost;
        x--; y--;
        Graf[x].push_back({cost, y});
    }
    viz.insert({0,0});
    while(viz.size()!=0)
    {
        int nod=viz.begin()->second;
        viz.erase(viz.begin());
        for(auto i: Graf[nod])
        {
            if(dist[nod]+i.first<dist[i.second])
            {
                 viz.erase({dist[i.second],i.second});
                 dist[i.second]=dist[nod]+i.first;
                 viz.insert({dist[i.second],i.second});
            }
        }
    }
    for(int i=1;i<n;i++)
        out<<dist[i]<<" ";
    return 0;
}