#include <vector>
#include <stdio.h>
#include <queue>
#include <climits>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
vector<int>graf[50001];
map<pair<int,int>,int>c;
int a[50001],n,m;
int shortest(int start,int stop)
{
    fill(a,a+n+1,INT_MAX);
    priority_queue<int>q;
    q.push(start);
    a[start]=0;
    while(!q.empty())
    {
        int nod=q.top();
        q.pop();
        for(int i=0;i<graf[nod].size();i++)
        {
            int vecin=graf[nod][i];
            if(a[nod]+c[make_pair(nod,vecin)]<a[vecin])
            {
                q.push(vecin);
                a[vecin]=a[nod]+c[make_pair(nod,vecin)];
            }
        }
    }
    return a[stop];
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int a,b,cost;
        scanf("%d %d %d",&a,&b,&cost);
        c[make_pair(a,b)]=cost;
        graf[a].push_back(b);
    }
    for(int i=2;i<=n;i++)
        printf("%d ",shortest(1,i));
    return 0;
}