#include<bits/stdc++.h>
#define  fi first
#define sc second
using namespace std;

#include <stdio.h>
#include <ctype.h>

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
} f("dijkstra.in");
ofstream g("dijkstra.out");
int n, m;
vector<pair<int, int>>v[100001];
set<pair<int, int>>s;
int dist[100001];
bool viz[100001];
void dijkstra(int nod)
{
    viz[nod]=1;
    for(int i=0; i<v[nod].size(); i++)
    {
        if(!viz[v[nod][i].fi])
        {
            viz[v[nod][i].fi]=1;
            dist[v[nod][i].fi]=dist[nod]+v[nod][i].sc;
            s.insert({v[nod][i].fi, dist[v[nod][i].fi]});
        }
        else
        {
            if(dist[nod]+v[nod][i].sc<dist[v[nod][i].fi])
            {
                s.erase({v[nod][i].fi, dist[v[nod][i].fi]});
                dist[v[nod][i].fi]=dist[nod]+v[nod][i].sc;
                s.insert({v[nod][i].fi, dist[nod]+v[nod][i].sc});
            }
        }
    }
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x, y, cost;
        f>>x>>y>>cost;
        v[x].push_back({y, cost});
        //v[y].push_back({x, cost});
    }
    s.insert({1, 0});
    while(!s.empty())
    {
        int a=(*s.begin()).fi;
        s.erase(s.begin());
        dijkstra(a);
    }
    for(int i=2; i<=n; i++)
    {
        g<<dist[i]<<' ';
    }
    return 0;
}