#include <fstream>
#include <vector>
#include <queue>
using namespace std;



ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int oo = (1 << 30);
const int NMAX = 50005;

vector < pair<int, int> > v[NMAX];
int n, m, node_start, d[NMAX];
bool viz[NMAX];

struct compara
{
    bool operator()(int x, int y)
    {
        return d[x] > d[y];
    }
};
	
priority_queue<int, vector<int>, compara> q;

void dijkstra(int p) {
    for(int i = 1; i <= n; ++i)
        d[i] = oo;
    d[p] = 0;
    q.push(p);
    viz[p] = 1;
    while(! q.empty()) {
        int node = q.top();
        q.pop();
        viz[p] = 0;
        for(size_t i = 0; i < v[node].size(); ++i) {
            int vecin = v[node][i].first;
            int cost = v[node][i].second;
            if(d[vecin] > d[node] + cost) {
                d[vecin] = d[node] + cost;
                if(!viz[vecin]){
                    q.push(vecin);
                    viz[vecin] = 1;
                }
            }
        }
    }
    for(int i = 2; i <= n; ++i)
            if(oo == d[i])
                out << 0 << ' ';
            else
                out << d[i] << ' ';
}

int main() {

    in >> n >> m;
    for(int i = 1; i <= m; ++i){
        int x, y, val;
        in >> x >> y >> val;
        v[x].push_back(make_pair(y, val));
    }

    dijkstra(1);

    return 0;
}