#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 LONG_LONG_MAX

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

void Dijkstra(vector<int> &d, vector<bool> &mark)
{
    for(int i=1;i<=n;i++)
    {
        int v=-1;
        for(int i=1;i<=n;i++)
        {
            if(!mark[i] && (v==-1 || d[i]<d[v])){v=i;}
        }
        if(d[v]==INT_MAX){break;}
        mark[v]=true;
        for(auto x:adj[v])
        {
            d[x.fs]=min(d[x.fs], d[v]+x.sc);
        }
    }
}

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, INT_MAX);
    vector<bool> m(n+10, false);
    dist[1]=0;
    Dijkstra(dist, m);
    for(int i=2;i<=n;i++)
        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;
}