#include <iostream>
#include <vector>
#include <list>
#include <queue>

using namespace std;

# define INF 1000000000

typedef pair<int, int> iPair;

void addEdge(vector <pair<int, int> > adj[], int u,
    int v, int wt)
{
    adj[u].push_back(make_pair(v, wt));
    adj[v].push_back(make_pair(u, wt));
}


void shortestPath(vector<pair<int, int> > adj[], int V, int src)
{
    priority_queue< iPair, vector <iPair>, greater<iPair> > pq;

    vector<int> dist(V, INF);

    pq.push(make_pair(0, src));
    dist[src] = 0;

    while (!pq.empty())
    {
        int u = pq.top().second;
        pq.pop();

        for (auto x : adj[u])
        {
            int v = x.first;
            int weight = x.second;

            if (dist[v] > dist[u] + weight)
            {
                dist[v] = dist[u] + weight;
                pq.push(make_pair(dist[v], v));
            }
        }
    }

    for (int i = 1; i < V; ++i)
        cout << dist[i] << " ";
}


int main()
{
    int N, M, A, B, W;
    cin >> N;
    cin >> M;
    vector<iPair >* adj = new vector<iPair>[N];
    for (int i = 0; i < M; i++)
    {
        cin >> A >> W >> B;
        A -= 1;
        B -= 1;
        addEdge(adj, A, B, W);
    }
    shortestPath(adj, N, 0);

    return 0;
}