#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

#define INF 0x3f3f3f
#define MAXN 50005

struct rct
{
    int nod, cost;
}act,urm,aux;

class comp
{
public:
    bool operator()(rct A, rct B)
    {
        return A.cost < B.cost;
    }
};

priority_queue<rct, vector<rct> , comp> coada;
vector<rct> graf[MAXN];
int n,m,i,j,x,y,z;
int d[MAXN];

int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>> x >> y >> z;
        act.nod = y; act.cost = z;
        graf[x].push_back(act);
    }

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

    act.nod=1; act.cost=0; coada.push(act);
    while(!coada.empty())
    {
        act=coada.top(); coada.pop();
        if(d[ act.nod ] != act.cost)
            continue;

        for(i=0; i<graf[ act.nod ].size(); i++)
        {
            urm = graf[act.nod][i];
            if( d[ urm.nod ] > d[ act.nod ] + urm.cost )
            {
                d[ urm.nod ] = d[ act.nod ] + urm.cost;
                aux.nod = urm.nod;
                aux.cost = d[ urm.nod ];
                coada.push(aux);
            }
        }
    }
    for(i=2; i<=n; i++)
        cout<<d[i]<<" ";
}