#include <bits/stdc++.h>

using namespace std;

ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
const int NMax=50005;
vector < pair<int, int> > g[NMax];
int n, m;
const int oo=INT_MAX;
int d[NMax];
bool use[NMax];
/*
Single source, single destination;
Single source, multiple destinations;
Multiple sources, multiple destinations;
*/

//Bellman Ford > Dijkstra (simplu, priority queue, liste) > Roy-Warshall-Floyd
priority_queue <pair<int, int>> pq;
int findMini()
{
    while (!pq.empty()&&use[pq.top().second]) {
        pq.pop();
    }
    if (pq.empty()) return -1;
    int next=pq.top().second;
    pq.pop();
    return next;
}
void read()
{
    int x, y, c;
    fin>>n>>m;
    for (int i=1; i<=m; i++) {
        fin>>x>>y>>c;
        g[x].push_back({y, c});
    }
}

void dijkstra()
{
    for (int i=2; i<=n; i++) d[i]=oo;
    pq.push({0, 1});
    for (int i=1; i<=n; i++) {
        int nod=findMini();
        cout<<nod<<endl;
        if (nod==-1) return;
        use[nod]=1;
        for (int i=0; i<g[nod].size(); i++) {
            int vecin=g[nod][i].first;
            int cost=g[nod][i].second;
            if (d[nod]+cost<d[vecin]) {
                d[vecin]=d[nod]+cost;
                pq.push({-d[vecin], vecin});
            }
        }
    }
}

void print()
{
    for (int i=2; i<=n; i++) {
        if (d[i]==oo) {
            fout<<0<<' ';
        }
        else {
            fout<<d[i]<<' ';
        }
    }
}

int main()
{
    fin.tie(0); fin.sync_with_stdio(false);
    fout.tie(0); fout.sync_with_stdio(false);
    read();
    dijkstra();
    print();
    return 0;
}