#include <bits/stdc++.h>
#define INF 1e9

using namespace std;

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

priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >pq;

vector<pair<int,int> >v[50001];

int n,m;
long long dist[50001];
bool viz[50001];

int main()
{
    f>>n>>m;

    for(int i=1;i<=m;++i)
    {

        int x,y,c;
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));

    }
    pq.push(make_pair(0,1));

    for(int i=2;i<=n;++i)
        dist[i] = INF;

    while(!pq.empty())
    {

        int nod = pq.top().second;
        pq.pop();

        if(!viz[nod])
        {

            viz[nod]=true;
            for(int i=0;i<v[nod].size();++i)
            {

                if(dist[nod]+v[nod][i].second<dist[v[nod][i].first])
                {
                    dist[v[nod][i].first] = dist[nod]+v[nod][i].second;
                    pq.push(make_pair(dist[v[nod][i].first],v[nod][i].first));
                }

            }

        }

    }

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

    return 0;
}