#include <fstream>
#include <vector>
#define INF 1000000000
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout("dijkstra.out");
vector<pair<int, int> > L[50010];
int V[50010],D[50010];
int n,m,i,nod,vecin,cost,a,b,c,minim;
int main ()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        L[a].push_back(make_pair(b,c));
    }

    D[1]=0;
    for(i=2;i<=n;i++)
        D[i]=INF;
    for(;;)
    {
        minim=INF;
        for(i=1;i<=n;i++)
            if(V[i]==0&&D[i]<minim)
            {
                minim=D[i];
                nod=i;
            }
        if(minim==INF)
            break;

        V[nod]=1;
        for(i=0;i<L[nod].size();i++)
        {
            vecin= L[nod][i].first;
            cost=L[nod][i].second;
            if(D[vecin]>D[nod]+cost)
                D[vecin]=D[nod]+cost;
        }

    }
    for(i=2;i<=n;i++)
        if(D[i]==INF)
            fout<<"0 ";
        else
            fout<<D[i]<<" ";
    return 0;
}