#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fr first
#define sc second
const int inf=INT_MAX;
const int nmax=5e4+5;
const int mod=1e9+7;
typedef long long ll;
using namespace std;
int n,m,x,y,c,i,j,dist[nmax],cost1,nxt;
vector<pair<int,int> >a[nmax];
set<pair<int,int> >s;
int main() 
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    //ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    cin>>n>>m;
    for(i=2;i<=n;i++)dist[i]=inf;
    while(m--)
    {
        cin>>x>>y>>c;
        a[x].pb(make_pair(y,c));
    }
    s.insert(make_pair(0,1));
    while(!s.empty())
    {
        cost1=s.begin()->fr;
        nxt=s.begin()->sc;
        s.er(s.begin());
        if(cost1!=inf)
         for(i=0;i<a[nxt].size();i++)
          if(dist[nxt]+a[nxt][i].sc<dist[a[nxt][i].fr])
          {
            if(dist[a[nxt][i].fr]!=inf)s.er(s.find(make_pair(dist[a[nxt][i].fr],a[nxt][i].fr)));
            dist[a[nxt][i].fr]=dist[nxt]+a[nxt][i].sc;
            s.in(make_pair(dist[a[nxt][i].fr],a[nxt][i].fr));
          }
    }
    for(i=2;i<=n;i++)
    {
        if(dist[i]!=inf)cout<<dist[i]<<" ";
        else cout<<"0 ";
    }
    return 0;
}