求调主席树样例过了但全 WA

#include<bits/stdc++.h>
using namespace std;
#define CIO
#ifdef LOCAL
ifstream in("data.in"); ostream &out = cout; ofstream err;
#endif
#ifdef CIO
istream &in = cin; ostream &out = cout;
#endif
#define newl '\n'

using LL = long long;
const int N = 150005;
int n, q, A, age[N], order[N];
int head[N], nxt[2 * N], to[2 * N], val[2 * N], tot;
void add(int x, int y, int z){
    to[++tot] = y, val[tot] = z, nxt[tot] = head[x], head[x] = tot;
}
int dfn[N], ts, siz[N], son[N], fr[N], fa[N], top[N], sum[N], dis[N];
LL sdis[N];
void upd_inf(int x){
    siz[x] = 1;
    for(int e = head[x]; e; e = nxt[e]){
        int y = to[e];
        if(y == fa[x]) continue;
        fa[y] = x, fr[y] = e;
        dis[y] = dis[x] + val[e];
        upd_inf(y), siz[x] += siz[y];
        if(siz[y] > siz[son[x]]) son[x] = y;
    }
}
void mark(int x, int tp){
    dfn[x] = ++ts, top[x] = tp;
    if(son[x]) mark(son[x], tp);
    for(int e = head[x]; e; e = nxt[e]){
        int y = to[e];
        if(y == son[x] || y == fa[x]) continue;
        mark(y, y);
    }
}
struct node{
    int ls, rs, ver, tag; LL sum;
} tr[47476266]; int rt[N], t;
void update(int &p){
    if(!p) p = ++t, tr[p].ver = ts;
    else if(tr[p].ver < ts){
        tr[++t] = tr[p];
        tr[p = t].ver = ts;
    }       
}
int cap(int l1, int r1, int l2, int r2){
    return sum[min(r1, r2)] - sum[max(l1, l2) - 1];
}
void modify(int ql, int qr, int &p, int l, int r){
    update(p);
    tr[p].sum += cap(l, r, ql, qr);
    if(ql <= l && r <= qr){
        tr[p].tag++;
        return;
    }
    int mid = (l + r) >> 1;
    if(ql <= mid) modify(ql, qr, tr[p].ls, l, mid);
    if(mid < qr) modify(ql, qr, tr[p].rs, mid + 1, r);
}
LL query(int ql, int qr, int p, int l, int r){
    if(ql <= l && r <= qr) return tr[p].sum;
    int mid = (l + r) >> 1;
    LL res = 1LL * cap(l, r, ql, qr) * tr[p].tag;
    if(ql <= mid) res += query(ql, qr, tr[p].ls, l, mid);
    if(mid < qr) res += query(ql, qr, tr[p].rs, mid + 1, r);
    return res;
}
LL solve(int x, int y){
    LL res = 0;
    while(x){
        res += query(dfn[top[x]], dfn[x], rt[y], 1, n);
        x = fa[top[x]];
    }
    return res;
}
int get_last(LL v){
    int l = 0, r = n;
    while(l < r){
        int mid = (l + r + 1) >> 1;
        if(age[order[mid]] <= v) l = mid;
        else r = mid - 1;
    }
    return l;
}

int main(){
    ios::sync_with_stdio(0), in.tie(0), out.tie(0);
    in >> n >> q >> A;
    for(int i = 1; i <= n; i++) in >> age[i];
    for(int i = 1; i <= n; i++) order[i] = i;
    sort(order + 1, order + n, [](const int &x, const int &y){
        return age[x] < age[y];
    });
    for(int i = 1; i < n; i++){
        int u, v, w; in >> u >> v >> w;
        add(u, v, w), add(v, u, w);
    }
    upd_inf(1), mark(1, 1), ts = 0;
    for(int i = 1; i <= n; i++) sum[dfn[i]] = val[fr[i]];
    for(int i = 1; i <= n; i++) sum[i] += sum[i - 1];
    for(int i = 1; i <= n; i++) sdis[i] = sdis[i - 1] + dis[order[i]];
    for(int i = 1; i <= n; i++){
        int x = order[i]; ++ts, rt[i] = rt[i - 1];
        while(x){
            modify(dfn[top[x]], dfn[x], rt[i], 1, n);
            x = fa[top[x]];
        }
    }
    LL ans = 0;
    while(q--){
        int x, a, b; in >> x >> a >> b;
        int l = min((a + ans) % A, (b + ans) % A);
        int r = max((a + ans) % A, (b + ans) % A);
        l = get_last(l - 1), r = get_last(r);
        ans = -2 * (solve(x, r) - solve(x, l)) + sdis[r] - sdis[l] + LL(r - l) * dis[x];
        out << ans << newl;
    }
    return 0;
}