#include "dreaming.h"
#include<bits/stdc++.h>
using namespace std;
long long n,m,yeah = 0;
vector<pair<long long,long long>> haha[100001];
vector<long long> dp(100001,-1);
long long dude(long long a, long long t, long long d) {
long long ans = max(dp[a],d),big = 0,big2 = 0,b,c,e;
yeah = max(yeah,dp[a]+d);
for(long long i = 0; i < haha[a].size(); i++) {
if(haha[a][i].first != t) {
b = haha[a][i].first;
c = haha[a][i].second;
if(dp[b]+c > big) {
big2 = big;
big = dp[b]+c;
}
else if(dp[b]+c > big2) {
big2 = dp[b]+c;
}
}
}
for(long long i = 0; i < haha[a].size(); i++) {
if(haha[a][i].first != t) {
b = haha[a][i].first;
c = haha[a][i].second;
if(c+dp[b] == big) {
e = max(d,big2)+c;
}
else {
e = max(d,big)+c;
}
ans = min(ans,dude(b,a,e));
}
}
return ans;
}
void dfs(long long a, long long t) {
dp[a] = 0;
for(long long i = 0; i < haha[a].size(); i++) {
if(haha[a][i].first != t) {
dfs(haha[a][i].first,a);
dp[a] = max(dp[a],dp[haha[a][i].first]+haha[a][i].second);
}
}
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
n = N;
m = M;
for(long long i = 0; i < m; i++) {
haha[A[i]].push_back({B[i],T[i]});
haha[B[i]].push_back({A[i],T[i]});
}
vector<long long> wut(0);
for(long long i = 0; i < n; i++) {
if(dp[i] == -1) {
dfs(i,-1);
wut.push_back(i);
}
}
vector<long long> wow(0);
for(long long i = 0; i < wut.size(); i++) {
wow.push_back(dude(wut[i],-1,0));
}
sort(wow.begin(),wow.end());
if(wow.size() == 1) {
return max(yeah,wow[0]);
}
else if(wow.size() == 2) {
return max(yeah,wow[0]+wow[1]+L);
}
else {
return max(yeah,max(wow[wow.size()-1]+wow[wow.size()-2]+L,wow[wow.size()-2]+wow[wow.size()-3]+2*L));
}
}
