#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
#define MAX 50001
#define INF 0xfffffff

vector<pair<int,int> >g[MAX];
set<pair<int,int> >s;

int n,d[MAX];

void dijkstra(){

    for(int i=2;i<=n;i++)d[i]=INF;
    s.insert(make_pair(0,1));
    while(s.size() > 0)
    {
        int x,y,c,cm;
        c=s.begin()->first;
        x=s.begin()->second;
        s.erase(s.begin());
        for(int i=0;i<g[x].size();i++)
        {
            cm=g[x][i].first;
            y=g[x][i].second;
            if(d[y] > c + cm)
            {
                d[y] = c + cm;
                s.insert(make_pair(d[y],y));
            }
        }
    }
}

int main(){
    int m,x,y,c;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
        scanf("%d %d",&n,&m);
        while(m--)
        {
            scanf("%d %d %d",&x,&y,&c);
            g[x].push_back(make_pair(c,y));
        }
    dijkstra();
        for(int i=2;i<=n;i++) printf("%d ",d[i]==INF ? 0 : d[i]);
    return 0;
}