//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>

namespace n91 {

	using i8 = std::int_least8_t;
	using i32 = std::int_least32_t;
	using i64 = std::int_least64_t;
	using u8 = std::uint_least8_t;
	using u32 = std::uint_least32_t;
	using u64 = std::uint_least64_t;
	using isize = std::ptrdiff_t;
	using usize = std::size_t;

	class rep {
		const usize f, l;

	public:
		class itr {
			friend rep;
			usize i;
			constexpr itr(const usize x) noexcept : i(x) {}

		public:
			void operator++() noexcept { ++i; }
			constexpr usize operator*() const noexcept { return i; }
			constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
		};
		constexpr rep(const usize first, const usize last) noexcept
			: f(first), l(last) {}
		constexpr itr begin() const noexcept { return itr(f); }
		constexpr itr end() const noexcept { return itr(l); }
	};
	class revrep {
		const usize f, l;

	public:
		class itr {
			friend revrep;
			usize i;
			constexpr itr(usize x) noexcept : i(x) {}

		public:
			void operator++() noexcept { --i; }
			constexpr usize operator*() const noexcept { return i; }
			constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
		};
		constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
		constexpr itr begin() const noexcept { return itr(l); }
		constexpr itr end() const noexcept { return itr(f); }
	};
	template <class T> using vec_alias = std::vector<T>;
	template <class T> auto md_vec(const usize n, const T &value) {
		return std::vector<T>(n, value);
	}
	template <class... Args> auto md_vec(const usize n, Args... args) {
		return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
	}
	template <class T> constexpr T difference(const T &a, const T &b) {
		return a < b ? b - a : a - b;
	}

} // namespace n91

#include <algorithm>
#include <iostream>
#include <utility>
#include <string>
#include <queue>

namespace n91 {

	void main_() {
		usize n, m;
		std::cin >> n >> m;
		struct edge {
			usize to;
			u64 cost;
			edge(usize x, u64 y) :to(x), cost(y) {}
			bool operator<(const edge &r)const {
				return r.cost < cost;
			}
		};
		std::vector<std::vector<edge>> g(n * 2);
		while (m--) {
			usize a, b;
			u64 c;
			std::cin >> a >> b >> c;
			--a;
			--b;
			g[a].emplace_back(b, c);
			g[b].emplace_back(a, c);
			g[a].emplace_back(n + b, 0);
			g[b].emplace_back(n + a, 0);
			g[n + a].emplace_back(n + b, c);
			g[n + b].emplace_back(n + a, c);
		}
		std::priority_queue<edge> que;
		static constexpr u64 INF = std::numeric_limits<u64>::max();
		std::vector<u64> dist(n * 2, INF);
		dist[0] = 0;
		que.emplace(0, 0);
		while (!que.empty()) {
			const usize v = que.top().to;
			const u64 d = que.top().cost;
			que.pop();
			if (dist[v] < d) {
				continue;
			}
			for (const auto &e : g[v]) {
				if (d + e.cost < dist[e.to]) {
					dist[e.to] = d + e.cost;
					que.emplace(e.to, dist[e.to]);
				}
			}
		}
		std::cout << 0 << std::endl;
		for (const auto i : rep(1, n)) {
			std::cout << dist[i] + dist[i + n] << std::endl;
		}
	}

} // namespace n91

int main() {
	n91::main_();

	return 0;
}