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

#define mp make_pair
#define pb push_back

using namespace std;

const int NMax = 50005;
const int MMax = 50005;
const int inf = 0x3f3f3f3f;

int N, M;

vector <  pair < int, int > >  G[MMax];
priority_queue < pair < int, int > > Q;

int dist[NMax], viz[NMax];

void Read()
{
    scanf("%d %d", &N, &M);

    for(int i=1; i<=M; ++i)
    {
        int x, y, c;
        scanf("%d %d %d", &x, &y, &c);

        G[x].pb(mp(y,c));
    }

    for(int i=2; i<=N; ++i)
        dist[i]=inf;

    dist[1] = 0;
}

void Dijkstra()
{
    Q.push(mp(0,1));

    while(!Q.empty())
    {
        int x, c;
        x = Q.top().second;
        c = -Q.top().first;
        Q.pop();

        vector < pair < int, int > > ::iterator it;

        for(it=G[x].begin(); it!=G[x].end(); ++it)
        {
            if(dist[it->first] > c + it->second)
            {
                dist[it->first] = c + it->second;
                Q.push(mp(-dist[it->first],it->first));
            }

        }
    }

    for(int i=2; i<=N; ++i)
        if(dist[i]!=inf)
            printf("%d ", dist[i]);
        else
            printf("0 ");
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    Read();
    Dijkstra();
    return 0;
}