#include <bits/stdc++.h>

using namespace std;
const int nmax = 50005;
int n, m, dist[nmax];
vector <int> graf[nmax], cost[nmax];

void dijkstra()
{
    set <pair<int,int> > s;
    int i, d, nod;
    for(i=2; i<=n; i++)
        dist[i]=INFINITY;

    s.insert(make_pair(0, 1));
    while(!s.empty())
    {
        d=(*s.begin()).first;
        nod=(*s.begin()).second;
        s.erase(*s.begin());
        for(i=0; i<graf[nod].size(); i++)
            if(dist[graf[nod][i]] > d+cost[nod][i])
            {
                dist[graf[nod][i]]=d+cost[nod][i];
                s.insert(make_pair(dist[graf[nod][i]], graf[nod][i]));
            }
    }
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    int x, y, c, i;
    scanf("%d %d", &n, &m);
    for(i=1; i<=m; i++)
    {
        scanf("%d %d %d", &x, &y, &c);
        graf[x].push_back(y);
        cost[x].push_back(c);
    }
    dijkstra();
    for(i=2; i<=n; i++)
    {
        if(dist[i]==INFINITY) dist[i]=0;
        printf("%d ", dist[i]);
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}