#include <fstream>
#include <climits>
#include <queue>
#include <vector>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
int n,m,i,x,y,c,d[50001];
typedef pair<int,int> tip;
priority_queue <tip,vector<tip>,greater<tip>> Q;
vector <pair<int,int>> a[50001];
void Dijkstra(int nod)
{
    d[nod]=0;
    Q.push({0,nod});
    while (!Q.empty())
    {
        int l = Q.top().first;
        int nodd = Q.top().second;
        Q.pop();
        if (l!=d[nodd])
            continue;
        for (auto i:a[nodd])
        {
            if (d[nodd]+i.second<d[i.first])
            {
                d[i.first]=d[nodd]+i.second;
                Q.push({d[i.first],i.first});
            }
        }
    }
}
int main()
{
    in>>n>>m;
    for (i=1;i<=m;++i)
    {
        in>>x>>y>>c;
        a[x].push_back({y,c});
    }
    for (i=1;i<=n;++i)
         d[i]=INT_MAX;
    Dijkstra(1);
    for (i=2;i<=n;++i)
         out<<d[i]<<" ";
}