#include "swap.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 3e5+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
bool f = false;
typedef struct EDGE{
ll src,dest,wet;
void init(ll aa,ll bb,ll cc){
src = aa;
dest = bb;
wet = cc;
return;
}
void printer(){
cout<<src<<" "<<dest<<" "<<wet<<nli;
return;
}
}edge;
edge qt;
bool cmp(const edge &aa,const edge &bb){
return aa.wet < bb.wet;
}
vector<edge> ve;
ll root;
ll parent[mx];
ll comp[mx];
vi adj[mx];
ll siz[mx];
bool flag[mx];
bool flag2[mx];
ll degree[mx];
ll ed[mx];
ll up[mx][30];
ll depth[mx];
typedef struct Disjoint_Set_Union{
// vi parent,siz;
// vector<bool> flag,flag2;
// vi degree;
ll srcparent,destparent;
void init(ll nodes,ll edgee){
// debug(nodes);
// debug(edgee);
fip(0,nodes+5){
degree[i] = 0;
siz[i] = 1;
}
fip(0,nodes+edgee+5){
comp[i] = i;
parent[i] = i;
flag2[i] = flag[i] = false;
}
// debug(nodes);
// debug(edgee);
return;
}
ll find(ll k){
return parent[k] == k ? k : parent[k] = find(parent[k]);
}
bool unite(ll u,ll v){
srcparent=find(u);
destparent=find(v);
degree[u]++;
degree[v]++;
cnt++;
f = 0;
if(srcparent == destparent)
flag2[cnt] = 1;
if(degree[u]>2 || degree[v]>2){
// f = 1;
// cout<<u<<" "<<v<<nli;
flag[cnt] = 1;
}
flag[cnt] = flag[cnt] | flag[comp[srcparent]] | flag[comp[destparent]];
flag2[cnt] = flag2[cnt] | flag2[comp[srcparent]] | flag2[comp[destparent]];
adj[cnt].push_back(comp[srcparent]);
adj[comp[srcparent]].push_back(cnt);
if(srcparent!=destparent){
adj[cnt].push_back(comp[destparent]);
adj[comp[destparent]].push_back(cnt);
}
if(srcparent != destparent){
if(siz[srcparent] < siz[destparent])
swap(srcparent,destparent);
parent[destparent] = srcparent;
siz[srcparent] += siz[destparent];
}
// debug(u);
// debug(v);
// debug(cnt);
// debug(flag2[cnt]);
// debug(flag[cnt]);
// debug(comp[srcparent]);
// debug(comp[destparent]);
// debug(flag2[comp[srcparent]]);
// debug(flag2[comp[destparent]]);
// if(f){
// cout<<flag2[cnt]<<nli;
// cout<<cnt<<" "<<comp[srcparent]<<" "<<comp[destparent]<<nli;
// cout<<flag2[comp[srcparent]]<<nli;
// cout<<flag2[comp[destparent]]<<nli;
// }
comp[srcparent] = cnt;
comp[destparent] = cnt;
return 1;
}
}DSU;
DSU dsu;
void dfs(ll u,ll par,ll de){
up[u][0] = par;
depth[u] = de;
fip(1,30){
// if(u==183472){
// debug(up[up[u][i-1]][i-1]);
// debug(up[u][i-1]);
// }
// if(up[u][i-1]>mx)
// cerr<<" tt"<<u<<nli;
// if(up[u][i-1]<0)
// cerr<<" tt"<<u<<nli;
// if(up[up[u][i-1]][i-1]<0)
// cerr<<" tt"<<u<<nli;
// if(up[up[u][i-1]][i-1]>mx)
// cerr<<" tt"<<u<<nli;
up[u][i] = up[up[u][i-1]][i-1];
}
// debug(u);
fx(adj[u]){
if(x!=par){
// if(ed[x] > ed[u])
// cout<<u<<" "<<x<<nli;
// debug(x);
// debug(u);
dfs(x,u,de+1);
}
}
return;
}
void init(int N, int M,vector<int> U,vector<int> V,vector<int> W) {
n = N;
m = M;
cnt = n-1;
// cerr<<"ok";
dsu.init(n,m);
fip(0,m){
qt.init(U[i],V[i],W[i]);
ve.push_back(qt);
}
// cerr<<"ok";
sort(ve.begin(),ve.end(),cmp);
// fx(ve)
// x.printer();
// cerr<<"ok";
fip(0,m){
ll u = ve[i].src;
ll v = ve[i].dest;
// cout<<u<<v<<nli;
dsu.unite(u,v);
ed[cnt] = ve[i].wet;
}
// cerr<<"ok";
root = cnt;
// debug(root);
// fip(0,root +1){
// cout<<i<<" "<<ed[i]<<nli;
// }
dfs(root,root,0);
return;
}
ll lca(ll aa,ll bb){
if(depth[aa] < depth[bb])
swap(aa,bb);
ll diff = depth[aa] - depth[bb];
// debug(depth[aa]);
// debug(depth[bb]);
fin(29,0)
if(diff & (1<<i))
aa = up[aa][i];
// debug(aa);
// debug(bb);
if(aa==bb)
return aa;
fin(29,0){
if(up[aa][i] != up[bb][i]){
aa = up[aa][i];
bb = up[bb][i];
}
}
return up[aa][0];
}
int getMinimumFuelCapacity(int X, int Y) {
ans = -1;
tptp = lca(X,Y);
// debug(tptp);
if(flag[tptp] || flag2[tptp])
return ed[tptp];
fin(29,0){
if((flag[up[tptp][i]] || flag2[up[tptp][i]]) == false)
tptp = up[tptp][i];
}
// cout<<tptp<<nli;
if(flag[up[tptp][0]] || flag2[up[tptp][0]])
ans = ed[up[tptp][0]];
return ans;
}
// int main(){
// ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
// int N,M;
// cin>>N>>M;
// vector<int> U(M),V(M),W(M);
// fip(0,M){
// cin>>U[i]>>V[i]>>W[i];
// }
// init(N,M,U,V,W);
// ll Q;
// cin>>Q;
// int sr,de;
// fip(0,Q){
// cin>>sr>>de;
// cout<<getMinimumFuelCapacity(sr,de)<<nli;
// }
// // cout<<"ok"<<nli;
// cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
// return 0;
// }
