#include <fstream>
#include <vector>
#include <queue>
#define in "dijkstra.in"
#define out "dijkstra.out"
#define oo 1e7
#define N 50003

using namespace std;

ifstream fin(in);
ofstream fout(out);

int n,m,x,y,c;
vector<pair<int,int> > g[N]; // v[x][y] = c, g[x].(y,c)

priority_queue<pair<int,int> >q; // q.first = -dist, q.second = nod_urm

int d[N];
bool f[N];

void Dijkstra()
{
    for(int i=2; i<=n; ++i)
        d[i] = oo;

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

    int nod,nodurm,costurm;

    while(!q.empty())
    {
        nod = q.top().second;
        q.pop();

        if(f[nod] == 1) continue;
        f[nod] = 1;

        for(int i=0; i<g[nod].size(); ++i)
        {
            nodurm = g[nod][i].first;
            costurm = g[nod][i].second;

            if(d[nodurm] > d[nod] + costurm)
            {
                d[nodurm] = d[nod] + costurm;
                q.push(make_pair(-d[nodurm],nodurm));
            }
        }
    }

    for(int i=2; i<=n; ++i)
        if(d[i] == oo) d[i] = 0;

}

int main()
{
    fin>>n>>m;
    while(m--)
    {
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }

    Dijkstra();

    for(int i=2; i<=n; ++i)
        fout<<d[i]<<" ";

    fin.close(); fout.close();
    return 0;
}