#include<bits/stdc++.h>
using namespace std;

int n,m,i,x,y,c;
int d[50002];

vector < pair<int,int> > G[50002];

int inf=1<<30;

priority_queue <pair<int,int>, vector< pair<int,int> >, greater< pair<int,int> > > q;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

void dijkstra(int st)
{
    q.push(make_pair(0,st));
    d[st]=0;
    int dist,vf;
    int i;
    while(!q.empty())
    {
        dist=q.top().first;
        vf=q.top().second;
        q.pop();
        if(dist>d[vf]) continue;

        for(vector< pair<int,int> >::iterator it=G[vf].begin();it<G[vf].end();it++)
        {
            int x=it->first;
            int cost=it->second;
            if(d[x]>dist+cost)
            {
                d[x]=dist+cost;
                q.push(make_pair(d[x],x));
            }
        }

    }
}

int main()
{
    fin>>n>>m;

    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }

    for(i=1;i<=n;i++)
        d[i]=inf;

    dijkstra(1);

    for(i=2;i<=n;i++)
        if(d[i]==inf) fout<<0<<" ";
        else fout<<d[i]<<" ";


    fin.close();
    fout.close();
    return 0;
}