#include <fstream>
#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct nod
{
    int nod, cost;
}p;
struct comparecost
{
    bool operator()(const nod& a, const nod& b)
    {
        return a.cost>b.cost;
    }
};
priority_queue<nod, vector<nod>, comparecost> h;
int n, m, i, j, x, y, cost;
vector <nod> v[50005];
bool viz[50005];
int dist[50005];
void dijkstra()
{
    h.push({1, 0});
    while(!h.empty())
    {
        p=h.top();
        h.pop();
        if(!viz[p.nod])
           for(vector <nod>::iterator it=v[p.nod].begin(); it!=v[p.nod].end(); it++)
           {
               if(dist[it->nod]>dist[p.nod]+it->cost)
               {
                   dist[it->nod]=dist[p.nod]+it->cost;
                   h.push({it->nod, dist[it->nod]});
               }
           }
           viz[p.nod]=1;
    }
}
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>cost;
        v[x].push_back({y, cost});
    }
    for(i=2; i<=n; i++)
        dist[i]=2e9;
    dijkstra();
    for(i=2; i<=n; i++)
      if(dist[i]==2e9)
        fout<<0<<" ";
    else
       fout<<dist[i]<<" ";
    return 0;
}