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

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

int d[MX];
int n,m;
bool viz[MX];

struct vecin
{
    int j,c;
};

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

vector<vecin> v[MX];
priority_queue<int, vector<int>, cmp> p;

void dijkstra()
{
    vector<vecin>::iterator it;
    int i,u,r;
    vecin x;
    p.push(1);
    viz[1] = 1;
    while(!p.empty())
    {
        u = p.top();
        p.pop();
        //viz[u] = 1;
        for(it=v[u].begin(); it!=v[u].end(); it++)
        {
            //
            r = d[u] + it->c;
            if(d[it->j]==0 || r<d[it->j])
            {
                d[it->j] = r;
            }
            if(viz[it->j] == 0)
            {
                p.push(it->j);
                viz[it->j] = 1;
            }
        }
    }
}

int main()
{
    int i,a,b,c;
    vecin y;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        y.j = b;
        y.c = c;
        v[a].push_back(y);
    }
    dijkstra();
    for(i=2; i<=n; i++) fout<<d[i]<<' ';

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