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


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


int n,m,x,y,z;
int d[50005];


struct el
{
    int nod,cost;
    bool operator < (const el &A) const
    {
        return cost > A.cost;
    }
};


vector < pair <int, int> > g[50005];
priority_queue < el > q;


void read()
{
    fin>>n>>m;
    for(int i=2;i<=n;i++)d[i]=1e9;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>z;
        g[x].push_back(make_pair(y,z));
    }
}


void dijkstra(int ns)
{
    d[ns]=0;
    q.push({ns,0});
    while(!q.empty())
    {
        el nod =q.top();
        int nc=nod.nod;
        q.pop();
        for(int i=0; i<g[nc].size();i++)
        {
            int vecin =g[nc][i].first;
            int cost =g[nc][i].second;
            if(d[nc]+cost<d[vecin])
            {
                d[vecin]=d[nc]+cost;
                el B;
                B.nod=vecin;
                B.cost=d[vecin];
                q.push(B);
            }

        }
    }
}


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