#include <bits/stdc++.h>
using namespace std;
const int NMAX=100001;

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

int n,m;
int d[NMAX+1];
vector<pair<int, int>>a[NMAX+1];

struct muchie
{
    int nod;
    bool operator <(const muchie &b) const
    {
        return (d[nod]>=d[b.nod]);
    }
};

priority_queue<muchie>pq;

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        a[x].emplace_back(y,c);
        a[y].emplace_back(x,c);
    }

    pq.push({1});
    for(int i=1; i<=n; i++)
        d[i]=INT_MAX;
    d[1]=0;

    while(!pq.empty())
    {
        int nod=pq.top().nod;
        pq.pop();

        for(pair<int, int> next:a[nod])
            if(d[nod]+next.second<d[next.first])
            {
                d[next.first]=d[nod]+next.second;
                pq.push({next.first});
            }
    }

    for(int i=1; i<=n; i++)
        if(d[i]==INT_MAX)
            d[i]=-1;

    for(int i=2; i<=n; i++)
        fout<<d[i]<<' ';

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