#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

const int Dim = 50003, Inf = 0x3f3f3f3f;

struct Nod
{
    int x, dist;
    bool operator < ( const Nod& y ) const
    {
        return dist > y.dist;
    }
};

int n, m;
vector<vector<pair<int, int>>> g;
priority_queue<Nod> q;
vector<int> d;

void Read();
void Dijkstra(int a);
void Write();

int main()
{
    Read();
    Dijkstra(1);
    Write();
    return 0;
}

void Read()
{
    fin >> n >> m;
    g = vector<vector<pair<int, int>>> (n + 1, vector<pair<int, int>>());
    int x, y ,z;
    for ( int i = 1; i <= m; i++ )
    {
        fin >> x >> y >> z;
        g[x].push_back({y, z});
    }
}

void Dijkstra(int a)
{
    d = vector<int>(n + 1, Inf);
    d[a] = 0;
    q.push({a, 0});
    int x, dist, y, dt;
    while( !q.empty() )
    {
        x = q.top().x;
        dist = q.top().dist;
        q.pop();
        if ( d[x] < dist )
            continue;
        for ( auto z : g[x] )
        {
            y = z.first; dt = z.second;
            if ( d[y] > d[x] + dt )
            {
                d[y] = d[x] + dt;
                q.push({y, d[y]});
            }

        }
    }
}
void Write()
{

	for (int i = 2; i <= n; ++i)
		if ( d[i] != Inf )
			fout << d[i] << ' ';
		else
			fout << 0 << ' ';
	fout.close();
}