#include <fstream>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include<bitset>
#include <map>
#include <cstring>
#include<algorithm>

using namespace std;

//solutie cuy= Bellman-Ford
//90p
int n, m;
int d[50001],vizitat[50001];

struct muchie {
    int vecin;
    int dist;
};

vector<muchie> graf[50001];
queue<int> q;

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

void resetD()
{
    for (int i = 1; i <= n; i++)
    {
        d[i] = INT_MAX;
    }
}

void algDist() {
    resetD();

    q.push(1);
    vizitat[1] = 1;
    d[1] = 0;
    while (!q.empty()) {
        int prec = q.front();
        vizitat[prec] = 0;
        q.pop();
        for (int i = 0; i < graf[prec].size(); i++)
        {
            int dist = graf[prec][i].dist;
            int vecin = graf[prec][i].vecin;
            if (d[vecin]> d[prec] + dist)
            {
                //adaug in d
                d[vecin] = d[prec] + dist;
                if (vizitat[vecin] == 0)
                {
                    vizitat[vecin] = 1;
                    q.push(vecin);
                }
            }
        }
    }
}



int main()
{
	fin >> n>>m;
	for (int i = 1; i <= m; i++)
	{
        int x, y, cost;
        fin >> x >> y >> cost;
        muchie a;
        a.vecin = y;
        a.dist = cost;
        graf[x].push_back(a);

       // a.vecin = x;
       // graf[y].push_back(a);
	}


    algDist();
    for (int i = 2; i <= n; i++)
    {
        if (d[i] == INT_MAX)
        {
            d[i] = 0;
        }
        fout << d[i] << " ";
        
    }
	fin.close();
	fout.close();
	return 0;

}