#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n, m;

vector < pair < int, int > > v[50005];

queue < int > q;

bool inq[50005];
int nr[50005];
int dist[50005];
const int inf = 2e9;

void Dijkstra (int start)
{
    dist[start] = 0; inq[start] = 1;
    q.push(start);

    while (!q.empty())
    {
        int nod = q.front();
        q.pop(); inq[nod] = 0;

        for (int i=0; i<v[nod].size(); i++)
        {
            int vecin = v[nod][i].first;
            int cost = v[nod][i].second;

            if (dist[nod] + cost < dist[vecin])
            {
                dist[vecin] = dist[nod] + cost;

                if (!inq[vecin])
                {
                    q.push(vecin);
                    inq[vecin] = 1;
                }
            }
        }
    }
}

int main()
{
    f >> n >> m;
    int x, y, c;
    while(f>>x>>y>>c)
        v[x].push_back(make_pair(y, c));


    for (int i=1; i<=n; i++)
        dist[i] = inf;

    Dijkstra(1);

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

    return 0;
}