#include <fstream>
#include <list>
#include <queue>
#define DIM 50001
#define INF 999990

using namespace std;

int n,m,x,y,c,d[DIM];
list<pair <int,int> > nod[DIM];
bool v[DIM];

struct point
{
    int x;
    bool operator <(const point &other) const
    {
        return d[x] > d[other.x];
    }
};

priority_queue<point> cd;

void dijkstra(int k)
{
    point q;
    q.x=k;
    v[k]=1;
    cd.push(q);
    while(!cd.empty())
    {
        point vf=cd.top();
        for(list<pair<int,int> >::iterator i=nod[vf.x].begin();i!=nod[vf.x].end();++i)
        {
            std::pair<int,int> z=*i;
            if(!v[z.first])
            {
                v[z.first]=1;
                d[z.first]=d[vf.x]+z.second;
                q.x=z.first;
                cd.push(q);
            }
        }
        cd.pop();
    }
}

int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y>>c;
        nod[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;++i)
    d[i]=INF;
    dijkstra(1);
    for(int i=2;i<=n;++i)
    {
        if(d[i]==INF) g<<"0 ";
        else
        g<<d[i]<<" ";
    }
    g<<'\n';
    f.close();
    g.close();
    return 0;
}