#include <iostream>
#include <vector>
#include <queue>
using namespace std;
vector<pair<int,int>>v[50005];
bool f[50005];
priority_queue<pair<int,int>>pq;
int rez[50005];
int main()
{
    int N,M,a,b,c,nd,cst;
    cin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        cin>>a>>b>>c;
        v[a].push_back({c,b});
    }
    pq.push({0,1});
    while(!pq.empty())
    {
        nd=pq.top().second;
        cst=-pq.top().first;
        pq.pop();
        if(f[nd]==1)
            continue;

        else
        {
        f[nd]=1;
        rez[nd]=cst;
            //for(i=0;i<v[nd].size();i++)
            for(auto i:v[nd])
            {
                if(f[i.second]==0)
                    {
                        pq.push({-(i.first+cst),i.second});
                    }
            }
        }
    }
    for(int i=2;i<=N;i++)
        cout<<rez[i]<<" ";
    return 0;
}