test/aoj/grl/range_query_on_tree_2.test.cpp

// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/GRL_5_E
#include <cstdint>
#include <iostream>
#include "data_structure/fenwick_tree.hpp"
#include "graph/graph.hpp"
#include "tree/hld.hpp"

int main(void) {
    int n;
    std::cin >> n;
    list_graph<void> g(n);
    for (int i = 0; i < n; ++i) {
        int k;
        std::cin >> k;
        while (k--) {
            int c;
            std::cin >> c;
            g.add_edges(i, c);
        }
    }

    heavy_light_decomposition hld(g);
    FenwickTree<std::int64_t, true> ft(n);
    int q;
    std::cin >> q;
    while (q--) {
        int t;
        std::cin >> t;
        if (t == 0) {
            int v, w;
            std::cin >> v >> w;
            auto f = [&](int a, int b) { ft.add(a, b, w); };
            hld.for_each_edge(0, v, f);
        } else {
            int v;
            std::cin >> v;
            std::int64_t ans = 0;
            auto f = [&](int a, int b) { ans += ft.sum(a, b); };
            hld.for_each_edge(0, v, f);
            std::cout << ans << '\n';
        }
    }

    return 0;
}