#include <fstream>
#include <vector>
#include <set>
#define INF 2000000000
using namespace std;
ifstream fi("dijkstra.in");
ofstream fo("dijkstra.out");
int n,m,i,x,y,c,D[50001],v,varf,cost;
set <pair <int,int> > S;
vector <pair <int,int> > V[50001];
int main()
{
    fi>>n>>m;
    for(i=1;i<=m;i++)
    {
        fi>>x>>y>>c;
        V[x].push_back(make_pair(y,c));
    }
    D[1]=0;
    for(i=2;i<=n;i++)
        D[i]=INF;
    S.insert(make_pair(0,1));
    while(!S.empty())
    {
        v=S.begin()->second;
        S.erase(S.begin());
        for(i=1;i<=V[v].size();i++)
        {
            varf=V[v][i-1].first;
            cost=V[v][i-1].second;
            if(D[varf]>D[v]+cost)
            {
                if(D[varf]!=INF)
                    S.erase(S.find(make_pair(D[varf],varf)));
                D[varf]=D[v]+cost;
                S.insert(make_pair(D[varf],varf));
            }
        }
    }
    for(i=2;i<=n;i++)
        if(D[i]==INF)
            fo<<"0 ";
        else
            fo<<D[i]<<" ";
    fi.close();
    fo.close();
    return 0;
}