#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define ll long long
#define sz size()

using namespace std;
/*const long long mod = 998244353;
long long fct[200005],invfct[200005],inv[200005];
long long put2[200005];
long long lgput (long long a, long long exp)
{
    long long rz=1;
    while(exp)
        if(exp&1)
            exp^=1,rz=rz*1LL*a%mod;
        else
            exp>>=1,a=a*1LL*a%mod;
    return rz;
}
long long cmb (long long n, long long k)
{
    if(n<k || k<0 || n<0)
        return 0;
    return fct[n]*1LL*invfct[k]%mod*1LL*invfct[n-k]%mod;
}
void init ()
{
    inv[1]=fct[0]=fct[1]=invfct[0]=invfct[1]=put2[0]=1,put2[1]=2;
    for(long long i=2;i<=200000;++i)
        put2[i]=put2[i-1]*2LL%mod,inv[i]=(mod-mod/i)*1LL*inv[mod%i]%mod,fct[i]=i*1LL*fct[i-1]%mod,invfct[i]=inv[i]*1LL*invfct[i-1]%mod;
}
long long v[200005];*/
//long long
const int inf=1<<30;
vector <pair <int, int> > v[50005];
bitset <50005> selectat;
priority_queue <pair <int, int> > h;
int d[50005], n, m;
void rez(int x0)
{
    for (int i = 1; i <= n; i++)
        d[i] = inf;
    d[x0] = 0;
    h.push({0, x0});
    while (!h.empty())
    {
        int x = h.top().second;
        h.pop();
        if (selectat[x])
            continue;
        selectat[x] = 1;
        for (auto p: v[x])
        {
            int y = p.first;
            int c = p.second;
            if (d[x] + c < d[y])
            {
                d[y] = d[x] + c;
                h.push({-d[y], y});
            }
        }
    }
}
void solve()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        cin>>x>>y>>c;
        v[x].pb({y,c});
    }
    rez(1);
    for(int i=2;i<=n;i++)
        {
            if(d[i]==inf)
               d[i]=0;
            cout<<d[i]<<" ";
        }
}
int main()
{
    solve();
    return 0;
}