#include <fstream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>

#define pii pair<int,int>

using namespace std;

ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");

long long int n,m,i,j,u,v,curr,p,l,k,val,ok,d[300005],ans,mod=1e9+7;
string s1,s2;
vector<pair<int,int>>g[300005];
queue<int>q;
set<pair<int,int>>s;
priority_queue < pii , vector < pii > , greater < pii > > pq;

void dijk (int st)
{
    for(i=1;i<=n;i++)
        d[i]=1e9;
    d[st]=0;
    s.insert({0,st});
    while(!s.empty())
    {
        set<pair<int,int>> :: iterator it=s.begin();
        int curr=it->second;
        s.erase(it);
        for(auto x:g[curr])
        {
            int vec=x.first;
            int cost=x.second;
            if(d[curr]+cost<d[vec])
            {
                d[vec]=d[curr]+cost;
                s.insert({d[vec],vec});
            }
        }
    }
}


int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>u>>v>>val;
        g[u].push_back({v,val});
    }
    dijk(1);
    for(i=2;i<=n;i++)
    {
        if(d[i]==1e9)
            cout<<0<<' ';
        else
        cout<<d[i]<<' ';
    }
    return 0;
}