#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
vector<pair<int, int> > L[50002];
int n, m, i, x, y, z, D[50002], h[50002], p[50002], nrh, s, p1, nod, vecin, cost;
void remove_root()
{
    h[1]=h[nrh];
    p[h[1]]=1;
    nrh--;
    p1=1;
    s=2;
    while(s<=nrh)
    {
        if(s+1<=nrh && D[h[s+1]]<D[h[s]])
            s++;
        if(D[h[s]]<D[h[p1]])
        {
            swap(h[s], h[p1]);
            p[h[s]]=s;
            p[h[p1]]=p1;
            p1=s;
            s*=2;
        }else
        {
            break;
        }
    }
}
void dijkstra()
{
    while(nrh!=0)
    {
        nod=h[1];
        remove_root();
        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;
                if(p[vecin]==0)
                {
                    h[++nrh]=vecin;
                    p[vecin]=nrh;
                    s=p[vecin];
                    p1=s/2;
                }else
                {
                    s=p[vecin];
                    p1=s/2;
                }
                while(p1!=0 && D[h[s]]<D[h[p1]])
                {
                    swap(h[s], h[p1]);
                    p[h[s]]=h[s];
                    p[h[p1]]=h[p1];
                    s=p1;
                    p1/=2;
                }
            }
        }
    }
}
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
int main()
{
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y>>z;
        L[x].push_back(make_pair(y, z));
    }
    memset(D, 127, sizeof(D));
    D[1]=0;
    h[++nrh]=1;
    p[1]=1;
    dijkstra();
    for(i=2; i<=n; i++)
        out<<D[i]<<" ";
    return 0;
}