/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod  4398042316799LL
#define DIM 60010000
#define base 256
#define bas 255
#define N 100100
using namespace std;
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

vector<pii > v[N];
priority_queue<pii > pq;
int x,y,c,D[N],m,n,viz[N];
int main ()
{
    f>>n>>m;
    FOR(i,1,m)
    {
        f>>x>>y>>c;
        v[x].pb(mp(y,c));
    }
    pq.push(mp(0,1));
    FOR(i,2,n)
    D[i]=(1<<30);

    while(1)
    {
        while(!pq.empty()&&viz[pq.top().se])
            pq.pop();
        if(pq.empty())
            break;
        x=pq.top().se;
        viz[x]=1;
        pq.pop();
        FITP(it,v[x])
        if(D[x]+it->se<D[it->fi])
        {
            D[it->fi]=D[x]+it->se;
            pq.push(mp(-D[it->fi],it->fi));
        }
    }

    FOR(i,2,n)
    if(D[i]==(1<<30))
        g<<"0 ";
    else
        g<<D[i]<<" ";
    return 0;
}