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

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

const int NMAX = 50005;
const int inf = 2e9;

bitset<NMAX>viz;
int dist[NMAX];
vector<pair<int, int> >v[NMAX];

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

priority_queue<int, vector<int>, comp> pq;

void Dijkstra(int x)
{
    dist[x] = 0;
    viz[x] = true;
    pq.push(x);
    while(!pq.empty())
    {
        x = pq.top();
        pq.pop();
        viz[x] = false;
        for(pair<int, int> el : v[x])
        {
            int nod = el.first;
            int cost = el.second;
            if(dist[x] + cost < dist[nod])
            {
                dist[nod] = dist[x] + cost;
                if(!viz[nod])
                {
                    pq.push(nod);
                    viz[nod] = true;
                }
            }
        }
    }
}

int main()
{

    int i, j, n, m, x, y, c;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({y, c});
    }

    for(i=0; i<=n; i++)
    {
        dist[i] = inf;
    }

    Dijkstra(1);

    for(i=2; i<=n; i++)
    {
        if(dist[i] == inf)
            fout<<0<<' ';
        else
            fout<<dist[i]<<' ';
    }
    return 0;
}