#include <iostream>
#include <fstream>
#include <vector>
#include <climits>
#include <queue>
#include <stdio.h>

using namespace std;

//ifstream fin("dijkstra.in");
//ofstream fout("dijkstra.out");


struct vecin
{
    int nod;
    int cost;
};


vector <vecin> graf[100005];

int viz[100005], dist[100005];
int n, m;


void init()
{
    for(int i = 0; i <= n; ++i)
        dist[i] = INT_MAX;
}

void citire()
{
    FILE *fin = fopen("dijkstra.in", "r");
    fscanf(fin, "%d %d", &n, &m);

    int x, y, c;

    for(int i = 0; i < m; ++i)
    {
        fscanf(fin, "%d %d %d", &x, &y, &c);
        vecin v;
        v.nod = y;
        v.cost = c;
        graf[x].push_back(v);
    }

//    while(fin>>x>>y>>c)
//    {
//        vecin v;
//        v.nod = y;
//        v.cost = c;
//        graf[x].push_back(v);
//    }
}

void BF(int x)
{
    //int coada[50000];
    //int p = 0, u = 0;

    //oada[u] = x;
    //viz[x] = 1;
    //dist[x] = 0;

    queue <int> cd;
    cd.push(x);
    viz[x] = 0;
    dist[x] = 0;
    //int p = 0, u = 0;

    while(!cd.empty())
    {
        //p++;
        x = cd.front();
        cd.pop();
        int dim = graf[x].size();
        for(int i = 0; i < dim; ++i)
        {
            if(dist[graf[x][i].nod] > dist[x] + graf[x][i].cost)
            {
                cd.push(graf[x][i].nod);
                dist[graf[x][i].nod] = dist[x] + graf[x][i].cost;
                viz[graf[x][i].nod] = 1;
            }
        }
    }

}

void afis_dist()
{
    FILE *fout = fopen("dijkstra.out", "w");
    for(int i = 2; i <= n; ++i)
    {
        if(viz[i] == 1)fprintf(fout, "%d ", dist[i]);
        else fprintf(fout, "0 ");
    }
}


int main()
{
    citire();
    init();
    BF(1);
    afis_dist();
    return 0;
}