#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <queue>
#define Nmax 5005
#define INF (1<<29)

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

vector <pair <int, int> > v[Nmax];
set <pair<int, int> > dij;
set <pair <int, int> > ::iterator it;
int d[Nmax];
int n, m;
int x, y, c;
int nod;

void dijkstra(int nod)
{
    d[nod]=0;
    dij.insert({nod, 0});
    while(!dij.empty())
    {
        int x=dij.begin()->first;
        int c=dij.begin()->second;
        dij.erase(dij.begin());
        for (int i = 0, l=v[x].size(); i < l; i++)
        {
            int y=v[x][i].first;
            int nc=v[x][i].second;
            if(d[y] > d[x]+nc)
            {
                it=dij.find({y, d[y]});
                if(it!=dij.end()) dij.erase(it);
                d[y]=d[x]+nc;
                dij.insert({y, d[y]});
            }
        }
    }
}

int main()
{
    f >> n >> m;

    for (int i = 1; i <= m; i++)
    {
        f >> x >> y >> c;
        v[x].push_back({y, c});
    }

    for (int i = 0; i <= n; i++) d[i]=INF;

    dijkstra(1);
    for (int i = 2; i <= n; i++)
        if(d[i]!=INF) g << d[i] << " ";
        else g << "0 ";
    return 0;
}