#include <iostream>
#include<fstream>
#include<vector>
#include<set>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

int dist[50010];
int n,m;

vector<std::pair<int,int>> drumuri [50010];

void read()
{
    int a,b,c;
    in>>n>>m;
    for(int i=0; i<n; i++)
        dist[i]=-1;

    for(int i=0; i<m; i++)
    {
        in>>a>>b>>c;
        drumuri[a-1].push_back(std::pair<int,int>(b-1,c));
    }

}


void dijkstra()
{
    set<std::pair<long long,int>> valori;
    valori.insert(std::pair<long long,int>(0,0));

    while(valori.size())
    {
        std::pair<long long,int>nod=*valori.begin();
        valori.erase(valori.begin());

        int index=nod.second;
        long long val=nod.first;
        for(unsigned i=0; i<drumuri[index].size(); i++)
        {
            long long nv=val+drumuri[index][i].second;
            int nindex=drumuri[index][i].first;
            if(nv< dist[nindex] || dist[nindex]==-1)
            {
                if(dist[nindex]!=-1)
                {
                    valori.erase(valori.find(std::pair<long long,int>(dist[nindex],nindex)));
                }
                dist[nindex]=nv;
                valori.insert(std::pair<long long,int>(nv,nindex));
            }
        }

    }

}

void prt()
{
    for(int i=1; i<n; i++)
        out<<max(dist[i],0)<<" ";


}

int main()
{
    read();
    dijkstra();
    prt();
    return 0;
}