#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
vector<int> h;
int n;
vector<vector<pii>> adj;
void dfs(int u, int p=-1, int w=0) {
h[u] = w;
for (auto [v, pe] : adj[u]) {
if (v==p) continue;
dfs(v, u, w+pe);
}
}
int t;
vector<int> comp;
void dfs1(int u, int p=-1) {
comp.push_back(u);
for (auto [v, w] : adj[u]) {
if (v==p) continue;
dfs1(v, u);
}
}
int travelTime(int N, int m, int L, int A[], int B[], int T[]) {
t=0;
n = N;
adj.assign(n, {});
vector<vector<int>> cmp;
vector<bool> vis(n, false);
vector<int> vals;
for (int i=0; i<m; i++) {
vals.push_back(T[i]);
adj[A[i]].push_back({B[i], T[i]});
adj[B[i]].push_back({A[i], T[i]});
}
if (n==1) {
return 0;
}
if (n==2) {
if (m==1) {
return T[0];
}
else return L;
}
if (m==1) {
return max(2*L, vals[0]+L);
}
if (m==0) return 2*L;
sort(vals.begin(), vals.end(), greater<int>());
int tmx=0, tsmx=0;
for (int i=0; i<m; i++) {
if (i<2) tmx+=vals[i];
if (i>0 && i<3) {
tsmx += vals[i];
}
}
return max({
tmx+L, tsmx+2*L
});
}
