#include <fstream>
#include <iostream>
#include <queue>
#define dim 50005
#define inf 1<<31-1

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int D[dim];
int n,m;
bool viz[dim];
vector < pair<int,int> > G[dim];

class compara
{
public :
    bool operator ()(int x,int y)
    {
        return D[x]>D[y];
    }
};

priority_queue < int, vector<int>, compara > Q;

void citire()
{
    fin>>n>>m;
    for(int i=0,x,y,c;i<m;i++)
    {
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
}

void dijkstra(int X)
{
//    memset(D,inf,sizeof(D));
    for(int i=1;i<=n;i++)
        D[i]=inf;
    D[X]=0;
    Q.push(X);
    viz[X]=1;
    while(!Q.empty())
    {
        int nod=Q.top();
        Q.pop();
        viz[nod]=0;
        int N=G[nod].size();
        for(int i=0;i<N;i++)
        {
            int vecin=G[nod][i].first;
            int cost=G[nod][i].second;
            if(D[nod]+cost<D[vecin])
            {
                D[vecin]=D[nod]+cost;
                if(!viz[vecin])
                {
                    viz[vecin]=1;
                    Q.push(vecin);
                }
            }
        }
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(D[i]!=inf)
            fout<<D[i]<<" ";
        else
            fout<<"0 ";
    }
}

int main()
{
    citire();
    dijkstra(1);
    afisare();
    return 0;
}