#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50000
#define INF 2000000000

using namespace std;
ifstream fi("dijkstra.in");
ofstream fo("dijkstra.out");
int n, m;
int VIZ[NMAX+5], DST[NMAX+5];
vector <pair <int, int> > OUT[NMAX+5];
priority_queue <pair <int, int> > PQ;

void citire(void)
{
    int x, y, c;
    fi>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fi>>x>>y>>c;
        OUT[x].push_back(make_pair(y, c));
    }
}

void dijkstra(int src)
{
    int nod, nods, cost, newCost;
    PQ.push({0, src});
    for(int i=2; i<=n; i++)
        DST[i]=INF;
    DST[1]=0;
    while(!PQ.empty())
    {
        nod=PQ.top().second;
        PQ.pop();
        VIZ[nod]=1;
        for(int i=0; i<OUT[nod].size(); i++)
        {
            nods=OUT[nod][i].first;
            cost=OUT[nod][i].second;
            newCost=DST[nod]+cost;
            if(newCost<DST[nods])
            {
                DST[nods]=newCost;
                if(!VIZ[nods])
                    PQ.push({-DST[nods], nods});
            }
        }
    }
}

void afisare(void)
{
    for(int i=2; i<=n; i++)
        if(DST[i]>=INF)
            fo<<0;
        else
            fo<<DST[i]<<" ";
}

int main()
{
    citire();
    dijkstra(1);
    afisare();
    fi.close();
    fo.close();
    return 0;
}