#include<cstdio>
#include<set>
#include<vector>
#define Infinit 0x3f3f3f3f
using namespace std;
set<pair<int,int> > s;
vector <pair<int, int> > lista[100001];
int d[100001],n;
void citire()
{
    int m,n1,n2,c;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&n1,&n2,&c);
        lista[n1].push_back(make_pair(c,n2));
    }
}
int main()
{
    int i,u,v,costu,costv;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    for(i=1;i<=n;i++)
        d[i]=Infinit;
    d[1]=0;
    s.insert(make_pair(0,1));
    while(!s.empty())
    {
        u=s.begin()->second;
        costu=s.begin()->first;
        s.erase(s.begin());
        for(i=0;i<lista[u].size();i++)
        {
            v=lista[u][i].second;
            costv=lista[u][i].first;
            if(d[v]>d[u]+costv)
            {
                if(d[v]!=Infinit)
                    s.erase(s.find(make_pair(d[v],v)));

            d[v]=d[u]+costv;
            s.insert(make_pair(d[v],v));
            }
        }
    }
    for(i=2;i<=n;i++)
        if(d[i]!=Infinit)
            printf("%d ",d[i]);
        else
            printf("0 ");
    return 0;
}