我不用倍增居然最大只跑124ms,这题评蓝确实高了，请求加强数据 代码

#include<bits/stdc++.h>
const int maxn = 1e4+5;
const int maxm = 5e4+5;
using namespace std;
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-f;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
int head[maxn],cnt;
struct nm{int to,next,val;}pa[maxn<<1];
void add(int u,int v,int w){
    pa[++cnt].to = v;
    pa[cnt].val = w;
    pa[cnt].next = head[u];
    head[u] = cnt;
}
struct edge{int st,en,val;}d[maxm<<1];
bool cmp(edge a,edge b){return a.val > b.val;}
int fa[maxn];
int find(int x){
    if(x==fa[x]) return x;
    return fa[x]=find(fa[x]);
}
int n,m;
void Kruskal(){
    sort(d+1,d+1+m,cmp);
    for(int i=1;i<=n;i++) fa[i]=i;
    for(int i=1;i<=m;i++){
        if(cnt==(n<<1)) break;
        int u=find(d[i].st);
        int v=find(d[i].en);
        if(u==v) continue;
        fa[u]=v;
        add(u,v,d[i].val);
        add(v,u,d[i].val);
    }
}
bool vis[maxn];
int f[maxn],fpa[maxn],dep[maxn];
void dfs(int now,int father,int depth){
    vis[now]=1;
    f[now]=father;
    dep[now]=depth;
    for(int i=head[now];i;i=pa[i].next){
        int nx=pa[i].to;
        if(nx==father){
            fpa[now]=pa[i].val;
            continue;
        }
        dfs(nx,now,depth+1);
    }
}
int LCA(int x,int y){
    if(find(x)!=find(y)) return -1;
    int ans=1e5+5;
    if(dep[x]<dep[y]) swap(x,y);
    while(dep[x]!=dep[y]){
        ans=min(ans,fpa[x]);
        x=f[x];
    }    
    if(x==y) return ans;
    while(x!=y){
        ans=min(ans,min(fpa[x],fpa[y]));
        x=f[x];
        y=f[y];
    }
    return ans;
}
int main(){
    n=read(),m=read();
    for(int i=1;i<=m;i++){
        int x=read(),y=read(),z=read();
        d[i].st = x;
        d[i].en = y;
        d[i].val = z;
    }
    Kruskal();
    for(int i=1;i<=n;i++) if(!vis[i]) dfs(i,i,0);
    int q=read();
    while(q--){
        int x=read(),y=read();
        cout<<LCA(x,y)<<endl;
    }
    return 0;
}