#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50001
#define infinit (1<<30)

using namespace std;

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

int n,m,dist[NMAX];
bool folosit[NMAX];
vector < pair < int, int > > Muchii[NMAX];
struct Comp {
    bool operator()(int x, int y) {
        return dist[x] > dist[y];
    }
};
priority_queue < int, vector < int >, Comp > coada;

void Dijkstra(int start) {
    for(int i=1; i<=n; i++)
        dist[i]=infinit;
    dist[start]=0;
    coada.push(start);
    folosit[start]=true;
    while(!coada.empty()) {
        int nod = coada.top();
        coada.pop();
        folosit[nod]=false;
        for(unsigned i=0; i<Muchii[nod].size(); i++) {
            int vecin = Muchii[nod][i].first;
            int cost = Muchii[nod][i].second;
            if(dist[nod]+cost<dist[vecin]) {
                dist[vecin]=dist[nod]+cost;
                if(folosit[vecin]==false) {
                    coada.push(vecin);
                    folosit[vecin]=true;
                }
            }
        }
    }
}

int main()
{
    int x,y,c;
    fin>>n>>m;
    for(int i=1; i<=m; i++) {
        fin>>x>>y>>c;
        Muchii[x].push_back(make_pair(y,c));
    }
    Dijkstra(1);
    for(int i=2; i<=n; i++) {
        if(dist[i]!=infinit) fout<<dist[i]<<' ';
        else fout<<"0 ";
    }
    return 0;
}