#include <fstream>
#include <cstring>
#include <vector>
#include <queue>

using namespace std;

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

const long long INF = 5e9;
const int NMAX = 50001;

struct Graf
{
    int to, len;

    bool operator  < (const Graf other) const
    {
        return len > other.len;
    }
};


priority_queue <Graf> pq;

vector <Graf> v[NMAX + 1];

int n, m;
long long dist[NMAX + 1];

void Dijkstra()
{
    while(!pq.empty())
    {
        Graf node = pq.top();
        int n = node.to;
        int d = node.len;
        pq.pop();
        if(dist[n] == INF)
        {
            dist[n] = d;
            for(int i = 0; i < v[n].size(); i++)
                if(dist[v[n][i].to] > d + v[n][i].len)
                    pq.push({v[n][i].to, d + v[n][i].len});
        }
    }
}

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

    pq.push({1, 0});
    Dijkstra();

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

    return 0;
}