#include <fstream>
#include <vector>
using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

#define MAX 50005
#define INF 1000000005

int n, m, a, b, c, d[MAX];
bool viz[MAX];
vector<pair<int, int> > g[MAX];

void dijkstra()
{
    for(int i = 1; i <= n; ++i)
    {
        d[i] = INF;
        viz[i] = false;
    }
    d[1] = 0;
    for(int i = 1; i <= n; ++i)
    {
        int minim = INF, nod;
        for(int j = 1; j <= n; ++j)
        {
            if(d[j] < minim and !viz[j])
            {
                minim = d[j];
                nod = j;
            }
        }
        viz[nod] = true;
        for(int j = 0; j < g[nod].size(); ++j)
        {
            int v = g[nod][j].first;
            int cost = g[nod][j].second;
            if(d[nod] + cost < d[v])
            {
                d[v] = d[nod] + cost;
            }
        }
    }
}

int main()
{
    cin.sync_with_stdio(false);
    cin >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        cin >> a >> b >> c;
        g[a].push_back(make_pair(b, c));
    }
    dijkstra();
    for(int i = 2; i <= n; ++i)
    {
        if(d[i] == INF)
        {
            cout << 0 << ' ';
        }
        else
        {
            cout << d[i] << ' ';
        }
    }
    cout << '\n';
    return 0;
}