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

int main()
{
    int n,m;
    in>>n>>m;
    int inf=1<<24;
    vector<vector<pair<int,int>>> Graf(n+2);
    vector <int> dist(n+2,inf);
    dist[1]=0;
    set <pair<int,int>> viz;
    for(int i=0;i<m;i++)
    {
        int a,b,c;
        in>>a>>b>>c;
        Graf[a].push_back({c,b});
    }
    viz.insert({0,1});
    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=2;i<=n;i++)
    {
        if(dist[i]==inf)
            out<<"0"<<" ";
        else
            out<<dist[i]<<" ";
    }
    return 0;
}