#include <iostream>
#include <fstream>
#include <utility>
#include <set>
#include <vector>
#include <queue>
#define NMAX 50001
#define INF 20000
#define nod second
#define cost first

using namespace std;

vector<int> G[NMAX],C[NMAX];
//set<pair<int,int> > heap;
int n,m,q,y,c,d[NMAX],x,val;

void dijakstra()
{
    priority_queue< pair<int,int> > T;
    int nods,costs;
    T.push(make_pair(0,1));
    while(!T.empty())
    {
        val = T.top().cost;
        x = T.top().nod;
        T.pop();
        for(int i=0;i<G[x].size();i++)
        {
            if(d[G[x][i]]> val + C[x][i])
            {
                d[G[x][i]]= val + C[x][i];
                T.push(make_pair(d[G[x][i]],G[x][i]));
            }
        }
    }
}

int main()
{
    ifstream  in("dijkstra.in");
    ofstream out("dijkstra.out");
    in >> n >> m;
    //cout << n;
    for(int i=0;i<m;i++)
    {
        in >> q >> y >> c;
        G[q].push_back(y);
        C[q].push_back(c);
    }

    for(int i=2;i<=n;i++)
        d[i] = INF;

    dijakstra();

    for(int i=2;i<=n;i++)
    {

        if(d[i]==INF)
            out << 0 << " ";
      else
            out << d[i] << " ";
    }
    return 0;
}