#include "bits/stdc++.h"
#include <algorithm>
#include "dreaming.h"
using namespace std;
vector<vector<array<int, 2>>> g;
vector<bool> used;
vector<int> dis, nodes, path;
int n;
void dfs(int u, bool collect = 0, int p = -1) {
used[u] = 1;
if (collect) {
nodes.push_back(u);
}
for (auto &[v, w] : g[u]) {
if (v == p) continue;
dis[v] = dis[u] + w;
dfs(v, collect, u);
}
}
int findCenter(int u) {
nodes.clear();
dis[u] = 1;
dfs(u, 1);
int ans = 1e9;
for (auto &v : nodes) {
dis[v] = 0;
dfs(v, 0, -1);
int node = 0;
for (auto &z : nodes) {
if (dis[node] < dis[z]) {
node = z;
}
}
ans = min(ans, dis[node]);
}
return ans;
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
int m = M, l = L;
n = N;
dis.resize(n + 1);
g.resize(n + 1);
used.assign(n + 1, false);
for (int i = 0; i < m; i++) {
int u = A[i], v = B[i], w = T[i];
u++, v++;
g[u].push_back({v, w});
g[v].push_back({u, w});
}
vector<int> mx;
for (int u = 1; u <= n; u++) {
if (used[u]) continue;
mx.push_back(findCenter(u));
}
sort(mx.rbegin(), mx.rend());
if (int(mx.size()) <= 2) return mx[0] + mx[1] + l;
return max(mx[1] + mx[2] + 2 * l, mx[0] + mx[1] + l);
}
