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

using namespace std;

vector <long int> v[50001],nod;
long int m,n,c,x,y,cost[50001],a,ok2=1,aux;
bool visited[50001];
const int inf=1<<30;

void dijkstra()
{
    int k,minim,i;
    while(ok2)
    {
               visited[a]=1;
        for(k=0; k<v[a].size(); k+=2)
            if(visited[v[a][k]]==false)
                if(cost[v[a][k]]>cost[a]+v[a][k+1])
                   {
                     cost[v[a][k]]=cost[a]+v[a][k+1];
                   }
        minim=inf;
        for(i=0; i<nod.size(); i++)
        {
            if(cost[nod[i]]<minim)
            {
                aux=nod[i];
                nod.erase(nod.begin()+i);
                i--;
                if(minim!=inf)
                {
                    nod.push_back(a);
                }
                minim=cost[aux];
                a=aux;
            }
        }

        if(minim==inf)
            ok2=0;
    }
}

int main()
{
    ifstream in("dijkstra.in");
    in>>n>>m;
    int i;
    for(i=0; i<m; i++)
    {
        in>>x>>y>>c;
        v[x].push_back(y);
        v[x].push_back(c);
    }
    for(i=2; i<=n; i++)
    {
        cost[i]=inf;
        nod.push_back(i);

    }
    a=1;
    dijkstra();
    ofstream out("dijkstra.out");
    for(i=2; i<=n; i++)
        if(cost[i]==inf)
            out<<0<<" ";
    else out<<cost[i]<<" ";
    in.close();
    out.close();
    return 0;
}