#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include "dreaming.h"
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using vi = vector<int>;
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define lb lower_bound
int res, par[100001], E[100001], D[100001];
vector<ii> adj[100001];
vector<int> S;
bool vis[100001];
int findSet(int v) {
if(par[v] == v) return v;
return par[v] = findSet(par[v]);
}
void unionSet(int u, int v, int L) {
u = findSet(u); v = findSet(v);
if(u == v) return;
if(max(E[u], E[v] + L) > max(E[v], E[u] + L)) swap(u, v);
res = max(res, E[u] + E[v] + L);
E[u] = max(E[u], E[v] + L);
par[v] = u;
}
void dfs(int v, int p, int dep) {
D[v] = dep; S.pb(v);
for(auto u : adj[v]) {
if(u.ff == p) continue;
dfs(u.ff, v, dep + u.ss);
}
}
void dfs(int v, int p, int dep, vector<int>& d) {
d[v] = dep;
for(auto u : adj[v]) {
if(u.ff == p) continue;
dfs(u.ff, v, dep + u.ss, d);
}
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
for(int l = 0; l < N; l++) par[l] = l;
for(int l = 0; l < M; l++) {
int U = A[l], V = B[l], W = T[l];
adj[U].pb({V, W}), adj[V].pb({U, W});
}
for(int l = 0; l < N; l++) {
if(vis[l]) continue;
dfs(l, l, 0);
int p = l;
for(auto u : S) {
if(D[u] <= D[p]) continue;
p = u;
}
vector<int> D1(N + 1, 0);
dfs(p, p, 0, D1); int to = p;
for(auto u : S) {
if(D1[u] <= D1[to]) continue;
to = u; res = max(res, D1[u]);
}
vector<int> D2(N + 1, 0); dfs(to, to, 0, D2);
int med = p, curr = 1e9 + 7;
for(auto u : S) {
if(D1[u] + D2[u] == D1[to]) {
if(max(D1[u], D2[u]) < curr)
med = u, curr = max(D1[u], D2[u]);
}
}
for(auto u : S) par[u] = med, vis[u] = 1;
E[med] = curr; S.clear();
}
for(int l = 1; l < N; l++)
unionSet(l - 1, l, L);
return res;
}
