#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define nmax 50005
#define inf (1<<30)
using namespace std;

struct nod{
    int y, cost;
} aux;

vector< vector <nod> > gf;
vector<int> dist;
queue<int> q;

void bellman(int s)
{
    q.push(s);
    dist[s] = 0;

    int  x, vecin, cost;
    while (!q.empty())
    {
        x = q.front();
            q.pop();
        for(int i=0; i<gf[x].size(); i++)
        {
            vecin = gf[x][i].y;
            cost = gf[x][i].cost;
            if (dist[x] + cost < dist[vecin])
            {
                dist[vecin] = dist[x] + cost;
                q.push(vecin);
            }
        }
    }


    return;
}
int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    int n, m, x, y, c;
    f >> n >> m;
    gf.resize(n+1);
    dist.resize(n+1);
    for(int i=1; i<=n; i++)
    {
        dist[i] = inf;
    }

    for(int i=1; i<=m; i++)
    {
        f >> x >> y >> c;
        aux.y = y;
        aux.cost = c;
        gf[x].push_back(aux);
    }
    bellman(1);

    for(int i=2; i<=n; i++)
    {
        if (dist[i]<inf)
             g << dist[i] << " ";
        else
             g << "0 ";
    }

    f.close();
    g.close();
    return 0;
}