#include <algorithm> #include <iostream> #include <utility> #include <vector> using namespace std; using i64 = long long; constexpr int INF = 0x3f3f3f3f; vector<vector<pair<int, int>>> idx; vector<vector<int>> tree; vector<int> a; void prepare(int u, int fa = -1) { for (auto v : tree[u]) { idx[u].emplace_back(v, a[v]); if (v != fa) prepare(v, u); } } inline int query(int u, int l, int r) { const auto& id = idx[u]; return lower_bound(id.begin(), id.end(), make_pair(l, -INF))->second - lower_bound(id.begin(), id.end(), make_pair(r, INF))->second; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n, q; cin >> n >> q; a.resize(n + 1); for (int i = 1; i <= n; ++i) cin >> a[i]; tree.resize(n + 1); for (int i = 1; i < n; ++i) { int u, v; cin >> u >> v; tree[u].push_back(v); tree[v].push_back(u); } for (int i = 1; i <= n; ++i) sort(tree[i].begin(), tree[i].end()); idx.resize(n + 1); prepare(1); for (int i = 1; i <= n; ++i) { idx[i].emplace_back(n + 1, 0); for (int j = idx[i].size() - 3; j >= 0; --j) idx[i][j].second += idx[i][j + 1].second; } while (q-- > 0) { int u, l, r; cin >> u >> l >> r; cout << query(u, l, r) << '\n'; } return 0; }