#include <cstdio>
#include <vector>
#include <set>
#include <cstring>
using namespace std;
vector < pair <int,int> > G[50005];
set <pair <int, int> > h;
const int INF=0x3f3f3f3f;
int d[50005],n,m,i,x,y,c,crt,nod,cost;
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d %d",&x,&y,&c);
        G[x].push_back(make_pair(y,c));
    }
    memset(d,INF,sizeof d);
    d[1]=0;
    h.insert(make_pair(0,1));
    while (!h.empty())
    {
        crt=h.begin()->second;
        h.erase(h.begin());
        for (i=0; i<G[crt].size(); i++)
        {
            nod=G[crt][i].first;
            cost=G[crt][i].second;
            if (d[crt]+cost<d[nod])
            {
                if (d[nod]!=INF) h.erase(h.find(make_pair(d[nod],nod)));
                d[nod]=d[crt]+cost;
                h.insert(make_pair(d[nod],nod));
            }
        }
    }
    for (i=2; i<=n; i++)
    {
        if (d[i]==INF) d[i]=0;
        printf("%d ",d[i]);
    }
    return 0;
}