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

#define x first
#define y second
#define MAXN 50001
#define INF 0x3f3f3f3f

using namespace std;

vector <pair<int, int > > G[MAXN];

int dist[MAXN], n, m;

class compare{
    public:
    bool operator () (int &x, int &y) {
        return dist[x] > dist[y];
    }
};

priority_queue< int, vector <int>, compare >heap;

void dijkstra()
{
    int node, son, edge;
    unsigned int i;

    heap.push(1);
    dist[1] = 0;

    while(!heap.empty())
    {
        node = heap.top();
        heap.pop();

        for(i=0; i<G[node].size(); ++i)
        {
            son = G[node][i].x;
            edge = G[node][i].y;

            if(dist[son] > dist[node] + edge)
            {
                dist[son] = dist[node] + edge;
                heap.push(son);
            }
        }
    }
}

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

    int i, x, y, z;

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

    for(i=1; i<=m; ++i)
    {
        scanf("%d%d%d", &x, &y, &z);
        G[x].push_back({y, z});
    }

    for(i=1; i<=n; ++i)
        dist[i] = INF;

    dijkstra();

    for(i=2; i<=n; ++i)
        printf("%d ", (dist[i] != INF ? dist[i] : 0));

    return 0;
}