#include<fstream>
#include<queue>
#include<vector>
#define MAX 50003
#define INFINITE (1<<30)
using namespace std;

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

vector < pair <int,int> > la[MAX];

int d[MAX],n,m,tata[MAX];

class cmp
{
public:
    bool operator()(int a, int b)
    {
        return d[a]>d[b];
    }
};

priority_queue<int,vector<int>,cmp> pq;

void citire()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int u,v,w;
        fin>>u>>v>>w;
        la[u].push_back(make_pair(v,w));
    }
}

void dijkstra(int nod)
{
    int u,v,w;
    for(int i=1;i<=n;i++)
    {
        d[i]=INFINITE;
        pq.push(i);
    }
    tata[nod]=d[nod]=0;
    while(!pq.empty())
    {
        u=pq.top();
        pq.pop();
        for(unsigned i=0;i<la[u].size();i++)
        {
            v=la[u][i].first;
            w=la[u][i].second;
            if(d[v]>d[u]+w)
            {
                d[v]=d[u]+w;
                tata[v]=u;
                pq.push(nod);
                pq.pop();
            }
        }

    }

}

void afis()
{
    for(int i=2;i<=n;i++)
        if(d[i]==INFINITE)
            fout<<0<<' ';
        else
            fout<<d[i]<<' ';
}

int main()
{
    citire();
    dijkstra(1);
    afis();
}