#include <cstdio>
#include <queue>
#include <vector>
#include <climits>

using namespace std;

#define NMAX 50001
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define PII pair < int , int >

int Dist[NMAX];
priority_queue < PII > Q;
vector < PII > L[NMAX];
int x,y,c,i,N,M;
bool marked[NMAX];

void Dijkstra(int start)
{
    Q.push(MP(0,start));

    for (int i=1;i<=N;++i) Dist[i]=INT_MAX;
    Dist[start]=0;

    while (Q.size())
    {
        int node=Q.top().second;
        Q.pop();

        if (marked[node]) continue;
        marked[node]=true;

        for (vector < PII > :: iterator it=L[node].begin();it!=L[node].end();++it)
        {
            if (Dist[(*it).F]<=Dist[node]+(*it).S) continue;

            Dist[(*it).F]=Dist[node]+(*it).S;

            Q.push(MP(Dist[(*it).F],(*it).F));
        }
    }
}

int main()
{
freopen("dijkstra.in","r",stdin);
freopen("dijkstra.out","w",stdout);

scanf("%d%d",&N,&M);
for (i=1;i<=M;++i)
  {
      scanf("%d%d%d",&x,&y,&c);
      L[x].push_back(make_pair(y,c));
  }

Dijkstra(1);

for (i=2;i<=N;++i) (Dist[i]==INT_MAX) ? printf("0 ") : printf("%d ",Dist[i]);

return 0;
}