#include <cstdio>
#include <vector>
#include <queue>

#define NMAX 50001
#define INF (1 << 30)

using namespace std;

int n;
int dist[NMAX];

struct cmp
{
    bool operator () (const int a, const int b) const
    {
        return dist[a] > dist[b];
    }
};

vector < pair < int, int > > vecin[NMAX];
priority_queue < int, vector < int >, cmp > Q;

void citire()
{
    int m, x, y, c;

    freopen("dijkstra.in", "r", stdin);

    scanf("%d %d", &n, &m);

    while(m --)
    {
        scanf("%d %d %d", &x, &y, &c);

        vecin[x].push_back(make_pair(y, c));
    }
}

void dijkstra(int start)
{
    Q.push(start);
    for(int i = 1; i <= n; dist[i ++] = INF);
    dist[start] = 0;

    while(!Q.empty())
    {
        int nod = Q.top();
        Q.pop();

        unsigned int nr_vecini = vecin[nod].size();
        for(unsigned int i = 0; i < nr_vecini; ++ i)
        {
            int nod_vecin = vecin[nod][i].first;
            int cost = vecin[nod][i].second;

            if(dist[nod_vecin] > dist[nod] + cost)
            {
                dist[nod_vecin] = dist[nod] + cost;
                Q.push(nod_vecin);
            }
        }
    }
}

void afisare_distante()
{
    freopen("dijkstra.out", "w", stdout);

    for(int i = 2; i <= n; ++ i)
        if(dist[i] == INF)
            printf("0 ");
        else
            printf("%d ", dist[i]);

    printf("\n");
}

int main()
{
    citire();
    dijkstra(1);
    afisare_distante();

    return 0;
}