#include <iostream>
#include<fstream>
#include<queue>
#include <limits.h>
const int noduri = 50005;
const int muchii = 250005;
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int d[noduri];
struct vecin
{
    int v, cost;
};

struct nod{
    int x, cost;
};

class ComparisonClass {
    public:
    bool operator() (nod Node1,nod Node2) {
        return Node1.cost>Node2.cost;
    }
};

priority_queue <nod, vector<nod>, ComparisonClass> PQ;
int Scoase[noduri];
vector <vecin> la[noduri];

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

    int x;
    vecin y;

    for(int i =1; i<=m; i++)
    {
        f>>x;
        f>>y.v>>y.cost;
        la[x].push_back(y);
    }

    for(int i=1; i<=n; i++)
        d[i]=INT_MAX;


    for(int i=1;i<=n;i++)
        Scoase[i]=0;

    d[1] = 0;
    nod u, v;
    u.x = 1;
    u.cost = 0;
    PQ.push(u);
    int q;
    while(!PQ.empty())
    {
        u=PQ.top();
        PQ.pop();
        if(Scoase[u.x]==1)
            continue;
        Scoase[u.x]=1;
        q = la[u.x].size();
        for(int i=0; i< q; i++)
        {
            v.x = la[u.x][i].v;
            if(u.cost +la[u.x][i].cost < d[v.x])
            {
                d[v.x]=u.cost + la[u.x][i].cost;
                v.cost = d[v.x];
                PQ.push(v);
            }
        }
    }

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

    f.close();
    return 0;
}