#include <vector>
#include <cstdio>
#include <queue>
#include <set>
using namespace std;
vector<pair<int,int> >f[50005];
const long long inf=1e10;
long long k,i,m,x,j,g[50005],ct;
set<pair<int,int> >s;
short h[50005];
void dijkstra()
{
    s.insert(make_pair(1,0));
    for(;!s.empty();)
    {
        k=s.begin()->first;
        s.erase(s.begin());
        for(i=0;i<h[k];i++)
        {
            if(g[k]+f[k][i].second<g[f[k][i].first])
            {
                //cout<<"pisici"<<endl;
                g[f[k][i].first]=g[k]+f[k][i].second;
                s.insert({f[k][i].first,g[f[k][i].first]});
            }
        }
    }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%lld%lld",&x,&m);
    for(k=1;k<=m;k++)
    {
        scanf("%lld%lld%lld",&i,&j,&ct);
        f[i].push_back(make_pair(j,ct));
    }
    for(k=2;k<=x;k++)
        g[k]=inf;
    for(k=1;k<=x;k++)
        h[k]=f[k].size();
    dijkstra();
    for(k=2;k<=x;k++)
    {
        if(g[k]==inf)
            printf("0 ");
        else
            printf("%lld ",g[k]);
    }
    return 0;
}