#include <fstream>
#include <vector>
#include <set>
#include <cstring>

using namespace std;

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

const int INF=0x3f3f3f3f;
vector < pair<int,int> > v[50005];
set <pair <int,int> > s;

int N,M,dist[50005];

void citire()
{
    int x,y,cost;
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        fin>>x>>y>>cost;
        v[x].push_back(make_pair(y,cost));
    }
}

void dijkstra(int nodInitial)
{
    int nod,vecin,cost;
    memset(dist,INF,sizeof(dist));
    dist[nodInitial]=0;
    s.insert(make_pair(0,nodInitial));
    while(!s.empty())
    {
        nod=s.begin()->second;
        s.erase(s.begin());
        for(vector< pair< int,int> >::iterator it=v[nod].begin();it!=v[nod].end();it++)
        {
            vecin=it->first;
            cost=it->second;
            if(dist[vecin]>dist[nod]+cost)
            {
                if(dist[vecin]!=INF)
                    s.erase(s.find(make_pair(dist[vecin],vecin)));
                dist[vecin]=dist[nod]+cost;
                s.insert(make_pair(dist[vecin],vecin));

            }
        }
    }
}

int main()
{
    citire();
    dijkstra(1);
    for(int i=2;i<=N;i++)
    {
        if(dist[i]!=INF)fout<<dist[i]<<' ';
        else fout<<0<<' ';
    }
    return 0;
}