#include <cstdio>
#include <vector>
#include <utility>
#define inf 99999999
using namespace std;
int i,j,t[50005],Min,m,n,k,x,y,d[55000],c;
vector <pair<int,int> > v[50005];
vector <pair<int,int> >::iterator it;
bool ok[55000];
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);
        v[x].push_back(make_pair(c,y));
    }
    for(i=1; i<=n; i++)
    d[i]=inf;
    d[1]=0;
    for(i=1; i<=n; i++)
    {
        Min=inf;
        for(j=1; j<=n; j++)
        {
            if(d[j]<Min && !ok[j])
            {
                Min=d[j];
                k=j;
            }
        }
        ok[k]=true;
            for(it=v[k].begin(); it!=v[k].end();it++)
            {
                if(d[(*it).second]>d[k]+(*it).first )
                {
                    d[(*it).second]=d[k]+(*it).first;
                }

            }

    }
    for(i=2; i<=n; i++)
        printf("%d ",d[i]);
        printf("\n");
    return 0;
}