test/yosupo/tree/vertex_add_path_sum.test.cpp

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/vertex_add_path_sum
#include <cstdint>
#include <iostream>
#include <vector>
#include "data_structure/fenwick_tree.hpp"
#include "graph/edge_input.hpp"
#include "tree/hld.hpp"

int main(void) {
    int n, q;
    std::cin >> n >> q;
    std::vector<int> a(n);
    for (auto &e : a) std::cin >> e;
    edge_input<void> ei(n - 1, 0);
    auto g = ei.to_undirected(n);
    heavy_light_decomposition hld(g);
    FenwickTree<std::int64_t> ft(n);
    for (int i = 0; i < n; ++i) ft.add(hld.get(i), a[i]);

    while (q--) {
        int c;
        std::cin >> c;
        if (c == 0) {
            int p, x;
            std::cin >> p >> x;
            ft.add(hld.get(p), x);
        } else {
            int u, v;
            std::cin >> u >> v;
            std::int64_t ans = 0;
            auto f = [&](int u, int v) { ans += ft.sum(u, v); };
            hld.for_each(u, v, f);
            std::cout << ans << '\n';
        }
    }

    return 0;
}