#include <fstream>
#include <vector>
#include <queue>
#define NMax 50005
#define oo 100000000
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

int N,M;
vector< pair<int,int> > G[NMax];
queue<int> Q;
int D[NMax];

void Read()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
        {
            int x,y,z;
            fin>>x>>y>>z;
            pair<int, int> P;
            //P.first = y; P.second = z;
            P = make_pair(y,z);
            G[x].push_back(P);
        }
}

void Solve()
{
    for(int i=2;i<=N;i++)
        D[i] = oo;
    Q.push(1);
    while(!Q.empty())
        {
            int Nod = Q.front(); Q.pop();
            for(unsigned int i=0;i<G[Nod].size();i++)
                {
                    int Vecin = G[Nod][i].first, Cost = G[Nod][i].second;
                    if(D[Vecin]>D[Nod]+Cost)
                        {
                            D[Vecin] = D[Nod]+Cost;
                            Q.push(Vecin);
                        }
                }
        }
}

void Print()
{
    for(int i=2;i<=N;i++)
        fout<<D[i]<<" ";
}

int main()
{
    Read();
    Solve();
    Print();
    return 0;
}