#include <iostream>
#include <limits.h>
#include <cmath>
#include <string>
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <stack>
#include <map>
#include <fstream>
#include <list>
#include <queue>
#include <iomanip>
#include <deque>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

#define cin f
#define cout g
#define mm 50001
#define inf (1<<30)

int n, m;
int dist[mm];
queue<int> q;
vector <int> d[mm], v[mm];

void Dijkstra(int nod)
{
    dist[nod] = 0;
    q.push(nod);

    for(int i = 2; i<=n; i++)
        dist[i] = inf;

    while(!q.empty())
    {
        int a = q.front();
        q.pop();

        for(int i = 0; i < v[a].size(); i++)
        {
            int b = v[a][i];
            if( dist[a] + d[a][i] < dist[b] )
            {
                dist[b] = dist[a] + d[a][i];
                q.push(v[a][i]);
            }
        }
    }
}


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

    for(int i=1; i<=m; i++)
    {
        int x,y,z;
        cin >> x >> y >> z;
        v[x].push_back(y);
        d[x].push_back(z);
    }

    Dijkstra(1);

    for(int i = 2; i<=n; i++)
        cout<<dist[i]<<" ";

return 0;
}