題目

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int n, q;
vector<int> G[maxn];
int L[maxn], R[maxn];//L[i]表示結點i的時間戳，R[i]表示結點i的后代中時間戳的最大值
int p[maxn];
int t[maxn];
struct Node{int id, flag, x;//id：第幾次詢問，flag：0為左端點，1為右端點，x：詢問結點
};
vector<Node> Q[maxn];//Q[i]存詢問區間左端點-1為i或右端點為i的詢問
int tot;
int ans[maxn][2];//ans[i][0]:第i次詢問，設詢問區間為[l, r], 詢問結點為x，只考慮p[1, l - 1], 有多少個結點的時間戳在[L[x], R[x]]范圍內， ans[i][1]:考慮p[1, r],有多少個結點時間戳在[L[x], R[x]]內
void dfs(int u, int fa){L[u] = ++tot;for(auto v : G[u]){if(v == fa) continue;dfs(v, u);}R[u] = tot;
}
int lowbit(int x){return x & (-x);
}
void add(int x, int k){for(int i = x; i <= n; i += lowbit(i)){t[i] += k;}
}
int ask(int x){int res = 0;for(int i = x; i >= 1; i -= lowbit(i)){res += t[i];}return res;
}
void init(){for(int i = 1; i <= n; i++){G[i].clear();t[i] = 0;}tot = 0;for(int i = 1; i <= q; i++){Q[i].clear();ans[i][0] = ans[i][1] = 0;}
}
void solve(){//int n, q;cin >> n >> q;init();for(int i = 1; i < n; i++){int u, v;cin >> u >> v;G[u].push_back(v);G[v].push_back(u);}for(int i = 1; i <= n; i++){cin >> p[i];}for(int i = 1; i <= q; i++){int l, r, x;cin >> l >> r >> x;l--;//！！！！Q[l].push_back({i, 0, x});Q[r].push_back({i, 1, x});}dfs(1, 0);for(int i = 1; i <= n; i++){// for(auto [id, flag, x] : Q[i]){// 	if(flag == 1) continue;// 	ans[id][flag] = ask(R[x]) - ask(L[x] - 1);// }int u = p[i];int pos = L[u];add(pos, 1);for(auto [id, flag, x] : Q[i]){//if(flag == 0) continue;ans[id][flag] = ask(R[x]) - ask(L[x] - 1);}}for(int i = 1; i <= q; i++){if(ans[i][0] == ans[i][1]) cout << "No\n";else cout << "Yes\n";}cout << '\n';
}
int main(){ios::sync_with_stdio(0);cin.tie(0);int T;cin >> T;while(T--){solve();}// map<int, int> mp;// mp[1] = 1;// mp[2] = 2;// for(auto [x, y] : mp){// 	cout << x << ' ' << y;// }return 0;
}