#include <stdio.h>
#include <map>
#include <vector>
#include <queue>

using namespace std;
#define INF 1000000000

struct node {
    map <int, int> ngb;
    bool inq;
};
typedef struct node Node;
vector <Node> noduri;
int d[5005];
queue<int> Q;

 void resolve () {
     bool change = true;
     bool first = true;
     Q.push(0);
     noduri[0].inq = true;
     while (!Q.empty())
     {
         int i = Q.front();
         d[0] = 0;
         Q.pop();
         noduri[i].inq = false;
         for (map<int, int>::iterator it = noduri[i].ngb.begin(); it != noduri[i].ngb.end(); it++) {
            if (it->second + d[i] < d[it->first])
            {
               d[it->first] = it->second + d[i];
               if (!noduri[i].inq)
               {
                   Q.push(it->first);
                   noduri[it->first].inq = true;
               }
            }
         }
       }
     }
 
             

int main () {
    freopen ("dijkstra.in", "r", stdin);
    freopen ("dijkstra.out", "w", stdout);

    int n, m, x, y, z;
    scanf ("%d %d", &n, &m);
    noduri.resize(n);
    for (int i = 0; i < m; i++)
    {
        scanf ("%d %d %d", &x, &y, &z);
 
        noduri[x - 1].ngb.insert (pair <int, int> (y - 1, z));

    }
    for (int i = 0; i < noduri.size(); i++)
    {
        noduri[i].inq = false;
        d[i] = INF;
    }
    resolve();
    for (int i = 1; i < n; i++)
    {
        if (d[i] == INF)
            printf("0 ");
        else
            printf ("%d ", d[i]);
    }
    return 0;
}