#include <fstream>
#include <set>
#include <vector>
#include <cstring>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m,dist[50005],to,nod,cost,i,x,y,c;
const int INF=0x3f3f3f3f;
vector < pair<int,int> > v[50005];
set < pair<int,int> > h;
vector< pair<int,int> >::iterator it;

void Dijkstra()
{

    memset(dist,INF,sizeof (dist));
    dist[1]=0;
    h.insert(make_pair(0,1));

    dist[1]=0;
    h.insert(make_pair(0,1));
    while(!h.empty())
    {
        nod=h.begin()->second;
        h.erase(h.begin());
        for(it=v[nod].begin();it!=v[nod].end();++it)
        {
        to=it->first;
            cost=it->second;
            if(dist[to]>dist[nod]+cost)
            {
                if(dist[to]!=INF) h.erase(h.find(make_pair(dist[to],to)));
                dist[to]=dist[nod]+cost;
                h.insert(make_pair(dist[to],to));
            }
        }
    }
}


int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }

    Dijkstra();

    for(i=2;i<=n;i++)
    {
        if(dist[i]!=INF)
            g<<dist[i]<<' ';
        else g<<0<<' ';
    }
    return 0;
}