#include <cstdio>
#include <deque>
#include <vector>
#define INF 2*1e9
using namespace std;
FILE *f=freopen("dijkstra.in", "r", stdin);
FILE *g=freopen("dijkstra.out", "w", stdout);
vector <pair<int ,int > > v[50001];
bool inqueue[50001];
int dmin[50001];
deque <int> q;
int n, m;
void read()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i<=m; i++)
    {
        int x, y, z;
        scanf("%d%d%d", &x, &y, &z);
        v[x].push_back(make_pair(y, z));
    }
}
void dijkstra(int start)
{
    for(int i = 1; i<=n; i++) dmin[i] = INF;
    inqueue[start] = true;
    q.push_back(start);
    dmin[start] = 0;
    while(!q.empty())
    {
        int node = q.front();
        q.pop_front();
        for(vector <pair <int, int> > :: iterator it = v[node].begin(); it != v[node].end(); it ++)
            if(dmin[node] + it -> second < dmin[it -> first])
            {
                dmin[it -> first] = dmin[node] + it -> second;
                if(!inqueue[it -> first])
                {
                    q.push_back(it -> first);
                    inqueue[it -> first] = true;
                }
            }

    }
}
int main()
{
    read();
    dijkstra(1);
    for(int i = 2; i<=n; i++)
        printf("%d ", (dmin[i] != INF ? dmin[i] : 0));
    return 0;
}