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

using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");


const int N = 5e4;
const long long INF = 2e9;
int n, m;
long long d[N+1];
bool viz[N+1];
vector < pair<int, int> > g[N+1];
priority_queue < pair<long long, int>, vector< pair<long long, int> >, greater< pair<long long, int> > > q;


void dijkstra(int root)
{
    for (int i = 1; i <= n; i++)
        d[i] = INF;
    
    d[root] = 0;
    q.push( make_pair(0, root) );

    while (!q.empty())
    {
        int node = q.top().second;
        q.pop();
        if (!viz[node])
        {
            viz[node] = 1;
            for (int i = 0; i < g[node].size(); i++)
            {
                int vec = g[node][i].first;
                int cost = g[node][i].second;
                if (!viz[vec] && d[node] + cost < d[vec])
                {
                    d[vec] = d[node] + cost;
                    q.push( make_pair(d[vec], vec) );
                }
            }
        }
    }
}


int main()
{
    cin >> n >> m;

    for (int i = 1; i <= m; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        g[a].push_back( make_pair(b, c) );
    }


    dijkstra(1);

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


    return 0;
}