#include <bits/stdc++.h>
#include "dreaming.h"
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const double eps = 1e-7;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
return (x > y ? x = y, 1 : 0);
}
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
V<PR<int>> g[100002];
int dep[100002];
V<bool> vis(100002);
PR<int> m1[100002], m2[100002];
int id = -1;
int mi;
void dfs(int v, int p) {
vis[v]=1;
for(auto [c, w] : g[v]) {
if(c == p)continue;
dep[c] = dep[v] + w;
dfs(c, v);
int Q = w + m1[c].ff;
if(Q > m1[v].ff) {
swap(m1[v], m2[v]);
m1[v] = mp(Q, c);
}
else if(Q > m2[v].ff) {
m2[v] = mp(Q, c);
}
}
}
void dfs2(int v, int p, int cmx, int seensofar) {
if(cmx < mi) {
mi = cmx;
id = v;
}
for(auto [c, w] : g[v]) {
if(c == p)continue;
int nseenf = (c == m1[v].se ? m2[v].ff : m1[v].ff) + w;
ckma(nseenf, seensofar + w);
dfs2(c, v, max(nseenf, m1[c].ff), nseenf);
}
}
int travelTime(int N, int M, int L,
int A[], int B[], int T[]) {
forn(i, M) {
g[A[i]].push_back({B[i], T[i]});
g[B[i]].push_back({A[i], T[i]});
}
V<int> root;
forn(i, N) {
if(!vis[i]) {
root.push_back(i);
dfs(i, -1);
}
}
int ret = 0;
forn(i, N) ckma(ret, m1[i].ff + m2[i].ff);
V<int> v;
for(auto c : root) {
mi = INF;
dfs2(c, -1, m1[c].ff, 0);
v.push_back(mi);
}
sort(all(v));
reverse(all(v));
if(sz(v)>1)ckma(ret, v[0]+v[1]+L);
if(sz(v)>2)ckma(ret,v[1]+v[2]+2*L);
return ret;
}
/*
int main() {
int a[] = {0, 8, 2, 5, 5, 1, 1, 10};
int b[] ={8, 2, 7, 11, 1, 3, 9, 6};
int c[] = {4, 2, 4, 3, 7, 1, 5, 3};
cout << travelTime(12, 8, 2, a, b, c) << '\n';
}
*/
