#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>

#define pb push_back
#define mp make_pair
#define PII pair<int,int>

using namespace std;

const int NMAX = 50005;
const int INF = (1LL<<31)-1;

int n,m,i,j,x,y,c,Dist[NMAX],from,where,cost_where;

vector<PII> V[NMAX];

bitset<NMAX> viz;

priority_queue<PII,vector<PII>,greater<PII> > Q;

void Read()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);

    scanf("%d%d",&n,&m);

    for(;m;m--)
    {
        scanf("%d%d%d",&x,&y,&c);
        V[x].pb(mp(y,c));
    }
}
void Dijkstra()
{
    for(i=2;i<=n;i++) Dist[i]=INF;
    Q.push(mp(0,1));

    while(!Q.empty())
    {
        from=Q.top().second;
        Q.pop();

        if(viz[from]) continue;
        viz[from]=1;

        for(vector<PII>::iterator it=V[from].begin();it!=V[from].end();it++)
        {
            where=it->first;
            cost_where=it->second;

            if(Dist[from]+cost_where<Dist[where])
            {
                Dist[where]=Dist[from]+cost_where;
                Q.push(mp(where,Dist[where]));
            }
        }
    }
}
void Print()
{
    for(i=2;i<=n;i++)
    {
        if(Dist[i]==INF) printf("0 ");
        else printf("%d ",Dist[i]);
    }
}
int main()
{
    Read();

    Dijkstra();

    Print();

    return 0;
}