#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];

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));
    }
}

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 y = Q.top().first;
        int x = Q.top().second;
        Q.pop();

        int l = vecini[x].size();

        for(int i = 0; i < l; i++)
        {
            if(viz[vecini[x][i].second] == 0 || viz[vecini[x][i].second] > viz[x] + vecini[x][i].first)
            {
                viz[vecini[x][i].second] = viz[x] + vecini[x][i].first;
                int tmp1 = vecini[x][i].first;
                int tmp2 = vecini[x][i].second;
                Q.push(vecini[x][i]);
            }
        }
    }
}

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

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

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

    return 0;
}