#include <fstream>
#include <vector>
#include <queue>
#define INF 1000000002
#define NMAX 50002
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,p=1;
vector<pair<int,int> >G[NMAX];
int cmin[NMAX];
class ComparVf
{
    public:
    bool operator() (int x,int y)
    {
        return cmin[x]>cmin[y];
    }
};
priority_queue <int,vector <int>, ComparVf> H;
void citire();
void dijkstra();
void afisare();
int main()
{
    citire();
    dijkstra();
    afisare();

    return 0;

}
void citire()
{
    int m;
    fin>>n>>m;
    int x,y,c;
    for(int k=0;k<m;k++)
    {
        fin>>x>>y>>c;
        G[x].push_back({y,c});
    }
}
void dijkstra()
{
    int vfmin,x,c;
    H.push(p);
    for(int i=1;i<=n;i++)
        cmin[i]=INF;
    cmin[p]=0;
    while(!H.empty())
    {
        vfmin=H.top();
        H.pop();
        if(cmin[vfmin]==INF)
            break;
        for(int i=0;i<G[vfmin].size();i++)
        {
            x=G[vfmin][i].first;
            c=G[vfmin][i].second;
            if(cmin[x]>cmin[vfmin]+c)
            {
                cmin[x]=cmin[vfmin]+c;
                H.push(x);
            }
        }

    }
}
void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(cmin[i]!=INF)
            fout<<cmin[i]<<' ';
        else
            fout<<0<<' ';
    }
}