#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int MAX=50005;
const int INF=1e9;
int n,m,a,b,c,viz[MAX],dist[MAX],inq[MAX];
struct M
{
    int nod,cost;
};
vector < M > v[MAX];
struct cmp
{
    bool operator()(M a, M b)
    {
        return a.cost>b.cost;
    }
};
priority_queue < M , vector < M > , cmp > pq;

void dijkstra(int start)
{
    viz[start]=1;
    dist[start]=0;
    pq.push({start,0});
    inq[start]=1;
    while(!pq.empty())
    {
        int nod=pq.top().nod;
        pq.pop();
        inq[nod]=0;
        for(auto vec : v[nod])
            if(!inq[vec.nod] && dist[nod]+vec.cost<dist[vec.nod])
            {
                dist[vec.nod]=dist[nod]+vec.cost;
                pq.push({vec.nod,dist[vec.nod]});
                inq[vec.nod]=1;
            }
    }
}

int main()
{
    fin >> n >> m;
    while(m--)
    {
        fin >> a >> b >> c;
        v[a].push_back({b,c});
    }
    for(int i=1;i<=n;i++)
        dist[i]=INF;
    dijkstra(1);
    for(int i=2;i<=n;i++)
        fout << (dist[i]!=INF?dist[i]:-1) << " ";
    return 0;
}