#include <iostream>
#include <vector>
#include <cstdio>
#include <queue>
#define NMAX 50005
#define MMAX 250005
#define inf 0x3f3f3f3f
using namespace std;

int N,M;
vector<pair<int,int> > graf[NMAX];
int d[NMAX],viz[NMAX];

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

void initialiare()
{
    for(int i=2; i<=N; i++)
        d[i]=inf;
}

priority_queue<pair<int,int> > q; ///cost, nod

void rezolva()
{

    q.push(make_pair(0,1));

    while(!q.empty())
    {
        int nod = q.top().second;
        int cost = -q.top().first;

        q.pop();
        for(vector<pair<int,int> >::iterator ii=graf[nod].begin(); ii!=graf[nod].end(); ii++)
        {
            if(cost + ii->second < d[ii->first])
            {
                d[ii->first] = cost + ii->second;
                q.push(make_pair(-d[ii->first],ii->first));
            }
        }

    }

}

void afisare()
{
    for(int i=2; i<=N; i++)
        if(d[i]==inf)
            printf("0 ");
        else
            printf("%d ",d[i]);
}

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    initialiare();
    rezolva();
    afisare();
    return 0;
}