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

using namespace std;

int n, m;
vector<pair<int, int> > vecini[50500];
int viz[50500];
int tata[50500];
const int limit = 1 << 30;

void citire()
{
    int tmp1, tmp2, tmp3;

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

    for(int i = 0; i < m; i++)
    {
        scanf("%d %d %d", &tmp1, &tmp2, &tmp3);
        tmp1--;
        tmp2--;

        vecini[tmp1].push_back(make_pair(tmp3, tmp2));
    }

    for(int i = 0; i < n; i++)
    {
        viz[i] = limit;
    }
}

void dijkstra()
{
    priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > Q;

    Q.push(make_pair(0, 0));
    viz[0] = 0;

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

        for(vector<pair<int, int> >::iterator it = vecini[x].begin(); it != vecini[x].end(); it++)
        {
            int nr = viz[x] + it->first;

            if(viz[it->second] > nr)
            {
                viz[it->second] = nr;
                Q.push(*it);
            }
        }
    }
}

void afisare()
{
    for(int i = 1; i < n; i++)
    {
        if(viz[i] == limit)
        {
            printf("0 ");
        }
        else
        {
            printf("%d ", viz[i]);
        }
    }
}

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

    citire();
    dijkstra();
    afisare();

    return 0;
}