#include <bits/stdc++.h>

const int INF = 1E9 + 4;

int N, M;
std::vector<std::pair<int, int>> edge[310000];
std::vector<std::tuple<int, int, int>> tedge;
int sufs[2][310000];
int ufs[310000];

int find(int x) {
	if (ufs[x] == x) return x;
	return ufs[x] = find(ufs[x]);
}

void merge(int x, int y) {
	x = find(x); y = find(y);
	if (x != y) {
		ufs[x] = y;
		sufs[0][y] = std::min(sufs[0][x], sufs[0][y]);
		sufs[1][y] = std::min(sufs[1][x], sufs[1][y]);
	}
}

int main() {
	scanf("%d%d", &N, &M);
	for (int i = 0; i < M; ++i) {
		int u, v, c;
		scanf("%d%d%d", &u, &v, &c);
		edge[u].push_back({v, c});
		edge[v].push_back({u, c});
		tedge.push_back({c, u, v});
	}
	for (int i = 1; i <= N; ++i) ufs[i] = i, sufs[0][i] = sufs[1][i] = INF;
	for (auto e: edge[1]) {
		sufs[0][e.first] = e.second;
	}
	for (auto e: edge[N]) {
		sufs[1][e.first] = e.second;
	}
	std::sort(tedge.begin(), tedge.end());
	int ans = INF + INF;
	for (auto e: edge[1]) {
		if (e.first == N) ans = std::min(ans, e.second);
	}
	for (int i = 0; i < (int) tedge.size(); ++i) {
		int c, u, v; std::tie(c, u, v) = tedge[i];
		merge(u, v);
		if (find(1) == find(N)) break;
		ans = std::min(ans, c + sufs[1][find(1)]);
		ans = std::min(ans, c + sufs[0][find(N)]);
	}
	printf("%d\n", ans);
}