#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int long long
#define double long double
#define pb push_back
#define endl '\n'
#define er erase
#define sz size
#define in insert
#define mp make_pair
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mod 1000000007
#define INF INT_MAX

int n, m;
vector<pair<int, int>> adj[50005];

void Dijkstra(vector<int> &d)
{
    set<pair<int, int>> s;
    s.insert({0, 1});
    while(!s.empty())
    {
        int v=s.begin()->second;
        s.erase(s.begin());
        for(auto x:adj[v])
        {
            int to=x.fs;
            int len=x.sc;
            if(d[v]+len<d[to])
            {
                s.erase({d[to], to});
                d[to]=d[v]+len;
                s.insert({d[to], to});
            }
        }
    }
}

void solve()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int u, v, d;
        cin>>u>>v>>d;
        adj[u].pb({v, d});
    }
    vector<int> dist(n+10, INF);
    dist[1]=0;
    Dijkstra(dist);
    for(int i=2;i<=n;i++)
        if(dist[i]==INF){cout<<0<<' ';}else{cout<<dist[i]<<' ';}
}

int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}