#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;


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


int n,m;
int d[50005];


struct muchie
{
    int vecin;
    int cost;
    bool operator < (const muchie &A) const
    {
        return cost > A.cost;
    }
};


vector <muchie> v[50005];
priority_queue <muchie> q;


void read()
{
    fin>>n>>m;
    int x;
    muchie y;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y.vecin>>y.cost;
        v[x].push_back(y);
    }
    for(int i=2;i<=n;i++)d[i]=1e9;
}


void dijkstra(int nod)
{
    d[nod]=0;
    q.push({nod,0});
    while(!q.empty())
    {
        int nnod=q.top().vecin;
        q.pop();
        int s=v[nnod].size();
        for(int i=0;i<s;i++)
        {
            int vecin =v[nnod][i].vecin;
            int cost =v[nnod][i].cost;
            if(d[nnod]+cost<d[vecin])
            {
                d[vecin]=d[nnod]+cost;
                muchie x;
                x.vecin=vecin;
                x.cost=d[vecin];
                q.push(x);
            }
        }
    }
}


int main()
{
    read();
    dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(d[i]!=1e9)fout<<d[i]<<" ";
        else fout<<0<<" ";
    }
    return 0;
}