#include<bits/stdc++.h>
#define cin fin
#define cout fout
#define Nmax 50008
#define oo 1<<30
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
struct nod
{
    int val,cost;
};
struct compar
{
    bool operator()(nod a,nod b)
    {
        return a.cost<b.cost;
    }
};
int n,m,i,j,v[Nmax],incoada[Nmax];
nod k;
priority_queue<nod,vector<nod>,compar> Q;
vector<pair<int,int>> G[Nmax];
void Dijkstra(int nodstart)
{
    for(i=1; i<=n; i++)
        v[i]=oo;
    Q.push({nodstart,0});
    incoada[nodstart]=1;
    v[nodstart]=0;
    while(!Q.empty())
    {
        k=Q.top();
        Q.pop();
        for(auto i:G[k.val])
            if(v[i.first]>v[k.val]+i.second)
            {
                v[i.first]=v[k.val]+i.second;
                if(incoada[i.first]==0)
                {
                    incoada[i.first]=1;
                    Q.push({i.first,v[i.first]});
                }
            }
    }
}
int main()
{
    cin>>n>>m;
    int a,b,c;
    for(i=1; i<=m; i++)
    {
        cin>>a>>b>>c;
        G[a].push_back(make_pair(b,c));
    }
    Dijkstra(1);
    for(i=2; i<=n; i++)
    {
        if(v[i]==oo)
            cout<<"-1 ";
        else
            cout<<v[i]<<" ";
    }
}