#include <bits/stdc++.h>

using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
int n,m,d[50100],x,y,c,ok[50100];
priority_queue< pair<int,int> ,vector<pair<int,int>> ,greater<pair<int,int>>> q;
vector<pair<int,int>> v[50100];
pair<int,int> z;
void dijkstra(int nod)
{
    q.push({0,nod});
    for(int i=1;i<=n;i++) d[i]=INT_MAX;
    d[nod]=0;
    while(!q.empty())
    {
        z=q.top();
        ok[z.second]=1;
        q.pop();
        for(auto it:v[z.second])
        {
           if(ok[it.second]==0&&d[it.second]>d[z.second]+it.first)
           {
              d[it.second]=d[z.second]+it.first;
              q.push({d[it.second],it.second});
           }
        }
    }
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y>>c;
        v[x].push_back({c,y});
    }
    dijkstra(1);
    for(int i=2;i<=n;i++) {
        if(d[i]==INT_MAX) d[i]=0;
        out<<d[i]<<" ";
    }
    return 0;
}