/** * author: otera * created: 05.02.2022 03:04:09 **/ #include #include #include namespace otera { class LCA { public: LCA(const std::vector> &g, int root = 0) { int _n = (int)g.size(); int _N = 1; while((1<<_N) < _n) ++ _N; parent.assign(_N, std::vector(_n, -1)); dep.assign(_n, -1); dfs(g, root); for(int i = 0; i + 1 < (int)parent.size(); ++ i) { for(int v = 0; v < _n; ++ v) { if(parent[i][v] != -1) { parent[i + 1][v] = parent[i][parent[i][v]]; } } } } int lca(int u, int v) const { if(dep[u] > dep[v]) std::swap(u, v); for(int i = 0; i < (int)parent.size(); ++ i) { if((dep[u] - dep[v]) & (1<= 0; -- i) { if(parent[i][u] != parent[i][v]) { u = parent[i][u]; v = parent[i][v]; } } return parent[0][u]; } int depth(int u) const { return dep[u]; } int dist(int u, int v) const { return dep[u] + dep[v] - 2 * dep[operator()(u, v)]; } int operator()(int u, int v) const { return lca(u, v); } private: std::vector dep; std::vector> parent; void dfs(const std::vector> &g, int root) { auto rec = [&](auto &&self, int v, int p, int d) -> void { dep[v] = d; parent[0][v] = p; for(int nv: g[v]) { if(nv == p) continue; self(self, nv, v, d + 1); } }; rec(rec, root, -1, 0); } }; } // namespace otera using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; using uint = unsigned; #define repa(i, n) for(int i = 0; i < n; ++ i) #define repb(i, a, b) for(int i = a; i < b; ++ i) #define repc(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__) #define rep1a(i, n) for(int i = 0; i <= n; ++ i) #define rep1b(i, a, b) for(int i = a; i <= b; ++ i) #define rep1c(i, a, b, c) for(int i = a; i <= b; i += c) #define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__) #define per(i,n) for(int i=n-1;i>=0;i--) #define per1(i,n) for(int i=n;i>=1;i--) typedef pair P; typedef pair LP; #define pb push_back #define eb emplace_back #define fr first #define sc second #define all(c) c.begin(),c.end() #define lb(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define ub(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define Sort(a) sort(all(a)) #define Rev(a) reverse(all(a)) #define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a)) #define si(c) (int)(c).size() inline ll popcnt(ull a){ return __builtin_popcountll(a); } #define tpow(n) (1LL<<(n)) #define unless(A) if(!(A)) ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;in(__VA_ARGS__) #define vec(type,name,...) vectorname(__VA_ARGS__) #define VEC(type,name,size) vectorname(size);in(name) #define vv(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define VV(type,name,h,w) vector>name(h,vector(w));in(name) #define vvv(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using pq = priority_queue; template using pqg = priority_queue, greater>; template void scan(T& a){ cin >> a; } template void scan(vector& a){ for(auto&& i : a) scan(i); } void in(){} template void in(Head& head, Tail&... tail){ scan(head); in(tail...); } void print(){ cout << ' '; } template void print(const T& a){ cout << a; } template void print(const vector& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } } int out(){ cout << '\n'; return 0; } template int out(const T& t){ print(t); cout << '\n'; return 0; } template int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; } #define CHOOSE(a) CHOOSE2 a #define CHOOSE2(a0,a1,a2,a3,a4,x,...) x #define debug_1(x1) cout<<#x1<<": "< P2; void solve() { INT(n); vvc g(n); vc es; int cma = 0; rep(i, n - 1) { INT(a, b, c); -- a, -- b; g[a].eb(b); g[b].eb(a); es.eb(c, P{a, b}); chmax(cma, c); } Sort(es); Rev(es); atcoder::dsu uf(n); otera::LCA lca(g); int ans = cma; vc deg(n); vc check(n, 1); rep(i, n - 1) { int a = es[i].sc.fr, b = es[i].sc.sc; int c = es[i].fr; if(!check[uf.leader(a)] or !check[uf.leader(b)]) { check[a] = check[b] = 0; } uf.merge(a, b); ++ deg[a], ++ deg[b]; debug(i, a, b, c, uf.size(a)); if(deg[a] > 2 or deg[b] > 2 or !check[a] or !check[b]) { check[uf.leader(a)] = 0; } if(uf.size(a) == i + 2 and check[uf.leader(a)]) { int can = (i == n - 2 ? cma - c : max(cma - c, es[i + 1].fr)); debug(cma - c, can); chmin(ans, can); } } out(ans); } signed main() { ios::sync_with_stdio(false); cin.tie(0); // cout << fixed << setprecision(20); // INT(t); rep(i, t)solve(); solve(); return 0; }