#include <iostream>
#include <fstream>
#include <vector>
#include    <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int oo= 2000000000;
const int NMax=50005;
int N,M,D[NMax];
bool In[NMax];
vector < pair <int,int> >G[NMax];

struct comp
{
    bool operator()(int x, int y)
    {
        return D[x] > D[y];
    }
};

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


void Print()
{
    for(int i=2;i<=N;++i)
        {
            if(D[i]==oo)
                D[i]=0;
            fout<<D[i]<<" ";

        }
        fout<<"\n";
    }

void Read()
{
    fin>>N>>M;

    for(int i=1;i<=M;++i)
    {
        int x,y,c;
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
}

void dijkstra()
{
    for(int i=1;i<=N;++i)
    {
        D[i]=oo;
    }
    D[1]=0;
    Q.push(1);
    In[1]=1;

     while(!Q.empty())
    {
        int Nod=Q.top();
        Q.pop();
        In[Nod]=0;

        for(unsigned i=0; i<G[Nod].size(); 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(In[Vecin]==0)
                {
                    Q.push(Vecin);
                    In[Vecin]=1;
                }
            }
        }
    }




}

int main()
{
     Read();
    dijkstra();
    Print();
    return 0;
}