#include <bits/stdc++.h>

using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int NMAX = 5e4 + 5;
const int INF = 2e9;
struct Radu{
    int next, cost;
};
struct HeapNode{
    int next, cost;
    bool operator < ( const HeapNode &other ) const{
        return other.cost < cost;
    }
};
int n;
int dist[NMAX];
bool viz[NMAX];
vector <Radu> g[NMAX];
priority_queue <HeapNode> q;
void dijkstra( int node ){
    q.push({node, 0});
    while( !q.empty() ){
        node = q.top().next;
        q.pop();
        if( viz[node] )
            continue ;
        viz[node] = 1;
        for( auto vecin : g[node] ){
//            out << node << " " << vecin.next << " " << vecin.cost << " " << dist[node] << " " << dist[vecin.next] << "\n";
            if( vecin.cost + dist[node] < dist[vecin.next] ){
                dist[vecin.next] = vecin.cost + dist[node];
                q.push({vecin.next, dist[vecin.next]});
            }
        }
    }
}
int main()
{
    int n, m;
    in >> n >> m;
    for( int i = 2; i <= n; i++ )
        dist[i] = INF;
    for( int i = 0; i < m; i++ ){
        int a, b, c;
        in >> a >> b >> c;
        g[a].push_back({b, c});
    }
    dijkstra(1);
    for( int i = 2; i <= n; i++ )
        if( dist[i] == INF )
            out << 0 << " ";
        else
            out << dist[i] << " ";

    return 0;
}