func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MAX_N = 300 * 1000 + 10;   long long dist[MAX_N], dist1[MAX_N];   vector<pair<int, int>> adj[MAX_N];   set<pair<long long, int>> s;   bool inPath[MAX_N];   pair<int, int> mx;   int nxt[MAX_N];   bool dfs_path(int u, int par = -1) {     for (auto x : adj[u]) {       int v = x.first;       if (v != par && dfs_path(v, u)) inPath[u] = true, nxt[u] = v;     }     return inPath[u];   }   long long dfs_dist(int u, int par = -1) {     if (inPath[u])       for (auto x : adj[u]) {         int v = x.first, w = x.second;         if (v == nxt[u]) dist1[v] = dist1[u] + w, dist[u] = dfs_dist(v, u) + w;       }     for (auto x : adj[u]) {       int v = x.first, w = x.second;       if (v != par && !inPath[v])         dist1[v] = dist1[u] + w, dist[v] = dist[u] + w, dfs_dist(v, u);     }     return dist[u];   }   bool cmp(pair<int, int> a, pair<int, int> b) {     if (min(a.first, b.first) < 0) return a.first < 0 ? true : false;     return dist1[a.first] + dist[a.second] < dist1[b.first] + dist[b.second];   }   void rem_block(int u, int par = -1) {     s.erase({dist[u], u});     for (auto x : adj[u]) {       int v = x.first;       if (v != par) rem_block(v, u);     }   }   void add_block(int u, int par = -1) {     s.insert({dist[u], u});     for (auto x : adj[u]) {       int v = x.first;       if (v != par) add_block(v, u);     }   }   void dfs(int u, int par = -1) {     if (inPath[u]) {       s.erase({dist[u], u});       for (auto x : adj[u]) {         int v = x.first;         if (v != par && v != nxt[u]) rem_block(v, u), dfs(v, u), add_block(v, u);       }       for (auto x : adj[u]) {         int v = x.first;         if (v != par && v != nxt[u]) rem_block(v, u);       }       for (auto it = s.rbegin(); it != s.rend(); it++)         if (it->second != nxt[u]) {           mx = max(make_pair(u, it->second), mx, cmp);           break;         }       if (nxt[u] != u) dfs(nxt[u], u);     } else if (!s.empty()) {       mx = max(make_pair(u, (*s.rbegin()).second), mx, cmp);       for (auto x : adj[u]) {         int v = x.first;         if (v != par) dfs(v, u);       }     }   }   int main() {     ios_base ::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);     int n, m;     cin >> n >> m;     for (int i = 1; i < n; i++) {       int u, v, w;       cin >> u >> v >> w;       u--, v--;       adj[u].push_back({v, w});       adj[v].push_back({u, w});     }     inPath[n - 1] = true, nxt[n - 1] = n - 1, mx = {-1, -1};     dfs_path(0), dfs_dist(0), add_block(0), dfs(0);     for (int i = 0; i < m; i++) {       int x;       cin >> x;       cout << min(dist1[mx.first] + dist[mx.second] + x, dist[0]) << endl;     }     return 0;   }   