#include <fstream>
#define nmax 50101
#define inf 1e9
#include <vector>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector <pair<int,int> > v[nmax];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >h;

int d[nmax],n,m,a,b,c,nod,i;
bool w[nmax];
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>a>>b>>c;
        v[a].push_back(make_pair(c,b));
    }
    for(i=1;i<=n;i++) d[i]=inf;
    d[1]=0;
    h.push(make_pair(0,1));
    while(!h.empty())
    {
        nod=h.top().second;
        h.pop();
        if(w[nod]) continue;
        w[nod]=1;
        for(i=0;i<v[nod].size();i++)
        {
            if(d[nod]+v[nod][i].first<d[v[nod][i].second])
            {

                d[v[nod][i].second]=d[nod]+v[nod][i].first;
                h.push(make_pair(d[v[nod][i].second],v[nod][i].second));
                }
        }
    }
    for(i=2;i<=n;i++)
        if(d[i]==inf)
        g<<'0'<<' ';
    else
        g<<d[i]<<' ';
    return 0;
}