#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50000
#define fr first
#define sd second
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

vector<pair<int, int>> vp[NMAX+10];
int val[NMAX+10];
int n, p, x, y, c, m;

void parc(int x)
{
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> qup;
    qup.push({0, x});
    val[x]=0;
    while(!qup.empty())
    {
        pair<int, int> tpv=qup.top();
        qup.pop();
        for(int i=0; i<vp[tpv.sd].size(); i++)
        {
            if(val[vp[tpv.sd][i].fr]==-1 || val[vp[tpv.sd][i].fr]>val[tpv.sd]+vp[tpv.sd][i].sd)
            {
                val[vp[tpv.sd][i].fr]=val[tpv.sd]+vp[tpv.sd][i].second;
                qup.push({val[vp[tpv.sd][i].fr], vp[tpv.sd][i].fr});
            }
        }
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        vp[x].push_back({y, c});
    }

    for(int i=1; i<=n; i++)
        val[i]=-1;
    parc(1);

    for(int i=2; i<=n; i++)
    {
        if(val[i]==-1)
            fout<<0<<' ';
        else
            fout<<val[i]<<' ';
    }

    return 0;
}