#include <fstream>
#include <vector>
#include <queue>
#define vecin first
#define cost second
using namespace std;

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

const int Inf = 1 << 30;
const int Max = 5e4 + 1;

int n, m;

vector <pair<int,int>> graf[Max];
vector <int> d(Max, Inf);

priority_queue <pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> q;

void dijkstra(int nod)
{
    q.push({0, nod});
    d[nod] = 0;
    while (!q.empty())
    {
        nod = q.top().second;
        q.pop();
        for (auto i : graf[nod])
            if (d[nod] + i.cost < d[i.vecin])
            {
                d[i.vecin] = d[nod] + i.cost;
                q.push({d[i.vecin], i.vecin});
            }    
    }
}

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

void print()
{
    for (int i = 2 ; i <= n ; ++i)
        if (d[i] == Inf)
            fout << 0 << " ";
        else
            fout << d[i] << " ";
}

int main()
{
    read();
    dijkstra(1);
    print();

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