#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;

#define pb push_back
#define F first
#define S second

#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

///**************************************************** C o d e ****************************************************///
///-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=///
ll n,m,lev[100005];
vll v[100005];
bool processed[100005];

main()
{
    fastio();
    cin>>n>>m;
    while(m--){
        ll a,b,c;
        cin>>a>>b>>c;
        v[a].pb({b,c});
    }

    for(ll i=1;i<=n;i++) lev[i] = 1e18;

    priority_queue<pll> q;
    q.push({0,1}); lev[1] = 0;
    while(!q.empty()){
        ll x=q.top().F,y=q.top().S;  ///x is negative cost for yth node
        q.pop();
        if (processed[y]) continue;
        processed[y] = true;
        for(auto i:v[y]){

            if(lev[i.F]>i.S-x){    ///if not visited or shorter route

                lev[i.F]=i.S-x;                 ///updating

                q.push({-lev[i.F],i.F});    ///pushing negative cost and node number
            }
        }
    }
    for(ll i=1;i<=n;i++) cout<<lev[i]<<' ';     ///printing
    cout<<'\n';
}


///Thank you.


///Brainless_Loco Terminates Here!