spoj QTREE （树链剖分边维护）

边维护的话就是把n - 1条边转换为n - 1的点来表示，选用dep深度更大的那个点。

然后在区间维护和查询的时候都需要将u -> son[u]放线段树中，还要判断是都是u != v一般是开2-num长度的线段树

PS：刚刚一直不知边换成点的具体操作，跪了很多次

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>


using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x)
#define PI acos(-1.0)
#define ITER set<int>::iterator
const int Mod = 1e9 + 7;

const int maxn = 3e4 + 10;


struct Edge
{
    int to,next;
}edge[maxn * 3];

int head[maxn],edge_num,top[maxn],fa[maxn],son[maxn],id[maxn],dep[maxn],siz[maxn],num;
int maxs[maxn << 2],a[maxn],flag[maxn << 2];
void add_edge(int x,int y)
{
    edge[edge_num] = (Edge){y,head[x]};
    head[x] = edge_num++;
}

//第一次搜索找出siz[],son[],dep[],fa[]
void dfs1(int rt,int pa,int d)
{
    dep[rt] = d;
    son[rt] = 0;
    fa[rt] = pa;
    siz[rt] = 1;
    for(int i=head[rt]; i!=-1; i=edge[i].next){
        int t = edge[i].to;
        if(t != fa[rt]){
            dfs1(t,rt,d+1);
            siz[rt] += siz[t];
            if(siz[son[rt]] < siz[t]){//如果父节点的son[rt]的iz[]小于子节点的siz[]更新son[]
                son[rt] = t;
            }
        }
    }
}

//第二次搜索找到w[],top[]
void dfs2(int rt,int tp)
{
    top[rt] = tp;
    id[rt] = ++num;

    if(son[rt] != 0)
        dfs2(son[rt],tp);//如果当前父节点纯在son 那么为了让链在线段树中连续 先对son[]进行搜索，并且重边顶端的点相同。

    for(int i=head[rt]; i!=-1; i=edge[i].next)
    {
        int t = edge[i].to;
        if(t != fa[rt] && son[rt] != t){
            dfs2(t,t);
        }
    }
}


void update(int pos,int val,int l,int r,int rt)
{
    if(l == r){maxs[rt] = val;return ;}
    int mid = (l + r) >> 1;
    if(pos <= mid)update(pos,val,l,mid,rt << 1);
    else update(pos,val,mid + 1,r,rt << 1|1);
    maxs[rt] = max(maxs[rt << 1],maxs[rt << 1|1]);
}
int query(int L,int R,int l,int r,int rt)
{
    if(L == l && R == r)
    {
        return maxs[rt];
    }
    int mid = (l + r) >> 1;
    if(R <= mid)return query(L,R,l,mid,rt << 1);
    else if(L >= mid + 1)return query(L,R,mid + 1,r,rt << 1|1);
    else return max(query(L,mid,l,mid,rt <<1),query(mid + 1,R,mid + 1,r,rt << 1|1));
}
int solve(int u,int v){
    int f1=top[u],f2=top[v],tmp= -INF;
    while(f1!=f2){
        if(dep[f1]<dep[f2]){
            swap(f1,f2);
            swap(u,v);
        }
        tmp = max( tmp,query(id[f1],id[u],2,num,1));
        u=fa[f1];f1=top[u];
    }
    if(dep[u]>dep[v]) swap(u,v);
    if(u != v)tmp = max ( tmp, query(id[son[u]],id[v],2,num,1));//son[u],判断u != v
    return tmp;
}
void Init()
{
    edge_num = num = 0;clr(head,-1);clr(maxs,-INF);
}
int U[maxn],V[maxn],W[maxn];
int main()
{
    int Tcase;scanf("%d",&Tcase);
    while(Tcase --)
    {
        Init();
        int n;scanf("%d",&n);int m = n - 1;
        for(int i = 1; i <= m;i ++){scanf("%d%d%d",&U[i],&V[i],&W[i]);add_edge(U[i],V[i]);add_edge(V[i],U[i]);}
        dfs1(1,1,1);dfs2(1,1);
        for(int i = 1; i <= n - 1; i ++)
        {
            if(dep[U[i]] > dep[V[i]])swap(U[i],V[i]);
            update(id[V[i]],W[i],2,num,1);
        }
        char s[10];int x,y;
        while( scanf("%s",s) && s[0] != 'D')
        {
            scanf("%d%d",&x,&y);
            if(s[0] == 'C')
            {
                update(id[V[x]],y,2,num,1);
            }
            else
            {
                printf("%d\n",solve(x,y));
            }
        }
    }
    return 0;
}