#include <fstream>
#include <queue>
//#include <iostream>
#define MX 50001
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int d[MX],s[MX];

struct vecin
{
    int j,c;    //tinem minte nodul vecin si lungimea muchiei
};

struct comp
{
    bool operator() (int a, int b)
    {
        return (d[a] > d[b]);
    }
};

int n,m;
queue<vecin> v[MX];
priority_queue<int, vector<int>, comp> p;

void citire()
{
    int i,a,b,c;
    vecin x;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        x.j=b;
        x.c=c;
        v[a].push(x);
    }
}

void dijkstra()
{
    p.push(1);
    s[1]=1;
    vecin x;
    int u,r;
    while(!p.empty())
    {
        u = p.top();
        p.pop();
        while(!v[u].empty())
        {
            x = v[u].front();
            v[u].pop();
            r = d[u] + x.c;
            if(d[x.j]==0 || r<d[x.j])
            {
                d[x.j] = r;
               if(s[x.j]==0){
                p.push(x.j);
                s[x.j]=1;
                }
            }
        }
    }
}

int main()
{
    int i;
    citire();
    //cout<<(sizeof(d)+sizeof(v)+sizeof(p)+sizeof(s))/1024;
    dijkstra();
    for(i=2; i<=n; i++) fout<<d[i]<<' ';

    fin.close(); fout.close();
    return 0;
}