#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second

struct edge {
    long long a, b, cost;
};

long long n, m;
long long dist[50001], parent[50001];
edge e[250001];
const long long INF = 1000000000;

void solve(){
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < m; i++){
        edge ed;
        cin >> ed.a >> ed.b >> ed.cost;
        e[i] = ed;
    }
    for(int i = 0; i <= n; i++){
        dist[i] = INF;
        parent[i] = -1;
    }
    dist[1] = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(dist[e[j].a] < INF){
                if(dist[e[j].b] > dist[e[j].a] + e[j].cost){
                    dist[e[j].b] = dist[e[j].a] + e[j].cost;
                    parent[e[j].b] = e[j].a;
                }
            }
        }
    }
    for(int i = 2; i <= n; i++)
        cout << dist[i] << ' ';
}  
 
int main(){
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}