#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50005
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int oo = (1 << 30);
int N, M;
int D[NMAX],viz[NMAX];
vector < pair <int,int> > G[NMAX];
priority_queue<int, vector<int> > q;
void Dijkstra(int ns)
{
    for(int i = 1; i <= N; i++)
        D[i] = oo;
    D[ns]=0;
    q.push(ns);
    viz[ns]=1;
    while(!q.empty())
    {
        int nodCurent = q.top();
        q.pop();
        viz[nodCurent]=0;
        for(unsigned int i = 0; i < G[nodCurent].size(); i++)
        {
            int vec = G[nodCurent][i].first;
            int Cost = G[nodCurent][i].second;
            if(D[nodCurent] + Cost < D[vec])
            {
                D[vec] = D[nodCurent] + Cost;
                if(viz[vec]==0)
                {
                    q.push(vec);
                    viz[vec]=1;
                }
            }
        }
    }
}

int main()
{
    fin >> N >> M;
    for(int i = 0; i < M; i++)
    {
        int A, B, C;
        fin >> A >> B >> C;
        G[A].push_back(make_pair(B,C));
    }
    Dijkstra(1);
    for(int i = 2; i <= N; i++)
    {
        if(D[i] != oo)
            fout << D[i] << " ";
        else
            fout << "0 ";
    }
    fin.close();
    fout.close();
}