#include <fstream>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<pair <int, int> > v[50003];
vector<pair <int, int> >::iterator it;
int n, m, i, a, b, c, cost, nod, vecin ,d[50003], f[50003], nr,mini;

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        v[a].push_back(make_pair(b, c));
    }
    for(i=1;i<=n;i++)
        d[i]=10000000;
    d[1]=0;
    nr=n;
    while(nr>0)
    {
        mini=10000000;
        for(i=1;i<=n;i++)
        {
            if(d[i]<mini&&f[i]==0)
            {
                mini=d[i];
                nod=i;
            }
        }
        f[nod]=1;
        nr--;
        for(it=v[nod].begin();it!=v[nod].end();it++)
        {
            vecin=it->first;
            cost=it->second;
            if(f[vecin]==0&&d[vecin]>d[nod]+cost)
            {
                d[vecin]=d[nod]+cost;
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==10000000)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    }
    fin.close();
    fout.close();
    return 0;
}