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

using namespace std;

//ifstream fin("date.in");
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int N,M;
int D[1000],S[1000];
int A[1000][1000];
vector <pair<int,int> > G[1000];

int INF = 2000000000;

void Read()
{
    fin>>N>>M;

    for(int i=1;i<=M;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;

        A[x][y] = A[y][x] = c;
        G[x].push_back(make_pair(y,c));
        G[y].push_back(make_pair(x,c));
    }

    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
        {
            if (A[i][j] == 0)
            {
                A[i][j] = INF;
            }

            if (i == j)
            {
                A[i][j] = 0;
            }
        }

    for(int i=1;i<=N;i++)
        D[i] = INF;
    D[1] = 0;
}

void DIJKSTRA()
{
    for(int p=1;p<=N;p++)
    {
        int Min = INF,Nod;

        for(int i=1;i<=N;i++)
        {
            if (D[i] < Min && S[i] == 0)
            {
                Min = D[i];
                Nod = i;
            }
        }

        S[Nod] = 1;

        for(int i=0;i<G[Nod].size();i++)
        {
            int v = G[Nod][i].first;
            //if (S[v] == 0)
            D[v] = min(D[v], D[Nod] + G[Nod][i].second);
        }

        /**for(int i=1;i<=N;i++)
        {
            if (A[Nod][i] != INF && Nod != i)
            {
                D[i] = min(D[i], D[Nod] + A[Nod][i]);
            }
        }*/
    }
}

int main()
{
    Read();

    DIJKSTRA();

    for(int i=2;i<=N;i++)
        fout<<D[i]<<' ';
    fout<<endl;

	return 0;
}