#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
#define INF (1<<30)
#define MAX 250005
vector < pair < int, int > > v[MAX];
queue < int > coada;
int cost[MAX];
int n, m;
void bellmanford()
{
    for(int i = 2; i<=n; i++)
        cost[i] = INF;
    coada.push(1);
    while(!coada.empty())
    {
        int nod = coada.front();
        coada.pop();
        for(int i = 0; i<v[nod].size(); i++)
        {
            int vecin = v[nod][i].first;
            if(cost[vecin] > cost[nod] + v[nod][i].second)
            {
                cost[vecin] = cost[nod] + v[nod][i].second;
                coada.push(vecin);
            }
        }
    }
    for(int i = 2; i<=n; i++)
        fout << cost[i] << " ";
}
int main()
{
    int a, b, c;
    fin >> n >> m;
    for(int i = 1; i<=m; i++)
    {
        fin >> a >> b >> c;
        v[a].push_back(make_pair(b, c));
    }
    bellmanford();
    fin.close();
    fout.close();
    return 0;
}