#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

#define N 50000
#define Inf 30000

using namespace std;

ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
vector<vector<int>> C;
vector<int> drum;
vector<bool> M;
int n, m;
int x, y, c;
int vMin, dMin;

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

    C.resize(n + 1);
    drum.resize(n + 1);
    M.resize(n + 1);

    fill(drum.begin(), drum.end(), Inf);
    fill(M.begin(), M.end(), false);

    for(int i = 1; i <= n; i++)
    {
        C[i].resize(n + 1);
        fill(C[i].begin(), C[i].end(), Inf);
    }

    while(in >> x >> y >> c)
    {
        C[x][y] = c;
    }

    for(int i = 1; i <= n; i++)
    {
        drum[i] = C[1][i];
    }

    M[1] = true;
    drum[1] = Inf;

    for(int i = 1; i < n; i++)
    {
        dMin = Inf;

        for(int j = 1; j <= n; j++)
        {
            if(!M[j] && drum[j] < dMin)
            {
                dMin = drum[j];
                vMin = j;
            }
        }

        M[vMin] = true;

        for(int j = 1; j <= n; j++)
        {
            if(!M[j] && dMin + C[vMin][j] < drum[j])
            {
                drum[j] = dMin + C[vMin][j];
            }
        }
    }

    for(int i = 2; i <= n; i++)
    {
        out << drum[i] << " ";
    }
    out << endl;
}