#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/timeb.h>
#include <vector>

using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define chmin(mi, value) mi = min(mi, value)
#define chmax(ma, value) ma = max(ma, value)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFR INT_MAX
#define INFL (long long)(4e18)
#define INFLR LLONG_MAX
#define EPS (1e-10)
#define MOD 1000000007
// #define MOD 998244353
#define PI 3.141592653589793238
#define RMAX 4294967295

using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vvvvd = vector<vvvd>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using vvs = vector<vector<string>>;
using Pi = pair<int, int>;
using vPi = vector<Pi>;
using vvPi = vector<vector<Pi>>;
using vvvPi = vector<vector<vector<Pi>>>;
using vvvvPi = vector<vector<vector<vector<Pi>>>>;
using Pll = pair<ll, ll>;
using vPll = vector<Pll>;
using Pd = pair<double, double>;
using vPd = vector<Pd>;
template <class T>
using vec = vector<T>;
template <class T>
using pql = priority_queue<T, vector<T>, greater<T>>;
using Comp = complex<double>;

// vvvvvvvvvvvvvvvvvvvvvvv debug output vvvvvvvvvvvvvvvvvvvvvvv
// vector input
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// deque
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    os << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, const set<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// multiset
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}

#define DUMPOUT cerr

void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                  \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                    \
            << "    ",                                                                             \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

// ^^^^^^^^^^^^^^^^^^^^^^^ debug output ^^^^^^^^^^^^^^^^^^^^^^^

random_device seed_gen;
mt19937 engine(seed_gen());

string YN(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "YES" : "NO");
}
string yn(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "Yes" : "No");
}
string ON(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "OK" : "NG");
}

int dir4[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<char> dirchar = {'R', 'L', 'D', 'U'};
int dir8[8][2] = {{-1, -1}, {0, -1}, {1, -1}, {-1, 0}, {1, 0}, {-1, 1}, {0, 1}, {1, 1}};

// [a,b)
int irand(int a, int b) {
    static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
    uniform_int_distribution<int> dist(a, b - 1);
    return dist(Rand);
}

// [a,b)
double drand(int a, int b) {
    static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
    uniform_real_distribution<double> dist(a, b);
    return dist(Rand);
}

// https://qiita.com/IgnorantCoder/items/3101d6276e9bdddf872c
template <typename A, typename F>
inline auto transform(const A &v, F &&f) {
    using result_type = decltype(std::declval<F>()(std::declval<typename A::value_type>()));
    vector<result_type> y(v.size());
    std::transform(std::cbegin(v), std::cend(v), std::begin(y), f);
    return y;
}

// generate vector which has multiple dimension
template <class T>
vector<T> make_v(size_t size, const T &init) {
    return vector<T>(size, init);
}
template <class... Ts>
auto make_v(size_t size, Ts... rest) {
    return vector<decltype(make_v(rest...))>(size, make_v(rest...));
}

template <typename T>
T Max(const vector<T> &a) {
    return *max_element(all(a));
}
template <typename T>
T Min(const vector<T> &a) {
    return *min_element(all(a));
}
template <typename T>
T Sum(const vector<T> &a) {
    return accumulate(all(a), (T)0);
}

// for counting using map
template <typename T>
void Add(map<T, int> &m, T item) {
    if (m.find(item) == m.end()) {
        m[item] = 1;
    } else {
        m[item]++;
    }
}

// for counting using map
template <typename T>
void Erase(map<T, int> &m, T item) {
    if (m.find(item) == m.end()) {
    } else {
        if (m[item] == 1) {
            m.erase(item);
        } else {
            m[item]--;
        }
    }
}

// get method for map with default value
template <typename T, typename U>
U Get(map<T, U> m, T key, U def) {
    if (m.find(key) == m.end()) {
        return def;
    } else {
        return m[key];
    }
}

template <typename T>
inline bool Contains(const set<T> &t, const T &key) {
    return t.find(key) != t.end();
}

template <typename T, typename U>
inline bool Contains(const map<T, U> &t, const T &key) {
    return t.find(key) != t.end();
}

template <class T>
struct Edge {
    int from, to;
    T cost;
    Edge(int f, int t, T c) : from(f), to(t), cost(c) {}
    Edge() {}
};
template <class T>
bool operator<(const Edge<T> e1, const Edge<T> e2) {
    return e1.cost < e2.cost || (e1.cost == e2.cost && e1.from < e2.from) ||
           (e1.cost == e2.cost && e1.from == e2.from && e1.to < e2.to);
}

template <class T>
ostream &operator<<(ostream &os, const Edge<T> &edge) {
    os << "(" << edge.from << "->" << edge.to << ":" << edge.cost << ")";
    return os;
}

template <class T = int>
class Graph {
    int n;
    bool directed;

  public:
    vector<vector<Edge<T>>> edges;
    Graph(int n, bool directed) : n(n), directed(directed), edges(vector<vector<Edge<T>>>(n)) {}
    Graph() {}

    void add_edge(int s, int t, T cost) {
        edges[s].emplace_back(s, t, cost);
        if (!directed) {
            edges[t].emplace_back(t, s, cost);
        }
    }
    void add_edge(Edge<T> e) {
        edges[e.from].push_back(e);
        if (!directed) {
            edges[e.to].emplace_back(e.to, e.from, e.cost);
        }
    }

    vector<Edge<T>> &operator[](size_t i) {
        return edges[i];
    }
    int size() const {
        return n;
    }
};

//======================================================

// rank, select が可能なビットベクトル
class BitVector {
    vector<int> cumulative_sum;
    int pos = 1;
    vector<int> pos_select;

  public:
    vector<vector<int>> select; // select[b][n] = n 番目（0-indexed）の b の位置

    BitVector(int n)
        : cumulative_sum(n + 1), pos_select(2, 0), select(2, vector<int>(n)) {
        cumulative_sum[0] = 0;
    }

    // 数 b を追加。n 回呼ばれる
    void push(int b) {
        cumulative_sum[pos] = cumulative_sum[pos - 1] + b;
        select[b][pos_select[b]] = pos - 1;
        pos++;
        pos_select[b]++;
    }

    int operator[](int idx) const {
        return cumulative_sum[idx + 1] - cumulative_sum[idx];
    }

    // [0, n) に x がいくつあるか
    int rank(int n, int b) const {
        if (n < 0) return 0;
        n = min(n, size());
        if (b == 1) {
            return cumulative_sum[n];
        } else {
            return n - cumulative_sum[n];
        }
    }

    int size() const {
        return cumulative_sum.size() - 1;
    }
};
ostream &operator<<(ostream &os, const BitVector &bv) {
    for (int i = 0; i < bv.size(); i++) {
        os << bv[i];
    }
    os << endl;
    return os;
}

class WaveletMatrix {
    int len;                       // 数列の長さ
    int digit = 0;                 // 値の桁数
    vector<BitVector> bit_vectors; // ビットベクトル
    vector<int> num_zero;          // 各段での 0 の個数
    vector<long long> sorted;      // ビット逆転ソート済み列
    map<int, int> start;           // sorted における各値の開始位置
    vector<vector<long long>> cumulative_sum; // 各段での累積和

  public:
    WaveletMatrix(vector<long long> v) {
        len = v.size();
        long long max_value = *max_element(v.begin(), v.end());
        while (max_value > 0) {
            max_value >>= 1;
            digit++;
        }
        if (digit == 0) digit++;

        bit_vectors.reserve(digit);
        cumulative_sum.reserve(digit);
        num_zero = vector<int>(digit, 0);
        for (int d = 0; d < digit; d++) {
            bit_vectors.emplace_back(len);
            cumulative_sum.emplace_back(len + 1, 0);
            // 累積和を記録
            for (int i = 0; i < len; i++) {
                cumulative_sum[d][i + 1] = cumulative_sum[d][i] + v[i];
            }
            // ビットベクトルの構築
            for (int i = 0; i < len; i++) {
                bit_vectors[d].push(v[i] >> (digit - 1 - d) & 1);
            }
            // 安定ソート
            vector<long long> temp;
            temp.reserve(len);
            for (int i = 0; i < len; i++) {
                if ((v[i] >> (digit - 1 - d) & 1) == 0) {
                    temp.push_back(v[i]);
                    num_zero[d]++;
                }
            }
            for (int i = 0; i < len; i++) {
                if ((v[i] >> (digit - 1 - d) & 1) == 1) {
                    temp.push_back(v[i]);
                }
            }
            v = temp;
        }
        for (int i = len - 1; i >= 0; i--) {
            start[v[i]] = i;
        }
        sorted = v;
    }

    // n 番目（0-indexed）の値を得る
    long long operator[](int n) const {
        int ans = 0;
        for (int d = 0; d < digit; d++) {
            ans <<= 1;
            ans += bit_vectors[d][n];
            if (bit_vectors[d][n] == 1) {
                n = num_zero[d] + bit_vectors[d].rank(n, 1);
            } else {
                n = bit_vectors[d].rank(n, 0);
            }
        }
        return ans;
    }

    // [0, n) に x がいくつ含まれるか
    int rank(int n, long long x) {
        if (start.find(x) == start.end()) return 0;
        for (int d = 0; d < digit; d++) {
            if ((x >> (digit - 1 - d) & 1) == 1) {
                n = num_zero[d] + bit_vectors[d].rank(n, 1);
            } else {
                n = bit_vectors[d].rank(n, 0);
            }
        }
        return n - start[x];
    }

    // n 番目（0-indexed）の x の位置（無ければ-1）
    int select(int n, long long x) {
        if (start.find(x) == start.end() || sorted[start[x] + n] != x)
            return -1;
        n = start[x] + n;
        for (int d = digit - 1; d >= 0; d--) {
            if ((x >> (digit - 1 - d) & 1) == 1) {
                n = bit_vectors[d].select[1][n - num_zero[d]];
            } else {
                n = bit_vectors[d].select[0][n];
            }
        }
        return n;
    }

    // [l, r) で n 番目（0-indexed）に小さい値 O(log(max))
    long long quantile(int l, int r, int n) {
        for (int d = 0; d < digit; d++) {
            if (bit_vectors[d].rank(r, 0) - bit_vectors[d].rank(l, 0) > n) {
                // 0
                l = bit_vectors[d].rank(l, 0);
                r = bit_vectors[d].rank(r, 0);
            } else {
                // 1
                n -= bit_vectors[d].rank(r, 0) - bit_vectors[d].rank(l, 0);
                l = num_zero[d] + bit_vectors[d].rank(l, 1);
                r = num_zero[d] + bit_vectors[d].rank(r, 1);
            }
        }
        return sorted[l];
    }

    // [l, r) で出現回数が多い順に k 個の値と頻度を返す O((r-l)log(max))
    vector<pair<long long, int>> topk(int l, int r, int k) {
        vector<pair<long long, int>> res;
        res.reserve(k);
        priority_queue<tuple<int, int, int, int>> pq;
        pq.push(make_tuple(r - l, 0, l, r));
        while (!pq.empty() && res.size() < k) {
            int dummy, d;
            tie(dummy, d, l, r) = pq.top();
            pq.pop();
            if (d == digit) {
                // 終わり
                res.push_back(make_pair(sorted[l], r - l));
                continue;
            }
            int l0 = bit_vectors[d].rank(l, 0);
            int r0 = bit_vectors[d].rank(r, 0);
            int l1 = num_zero[d] + bit_vectors[d].rank(l, 1);
            int r1 = num_zero[d] + bit_vectors[d].rank(r, 1);
            pq.push(make_tuple(r0 - l0, d + 1, l0, r0));
            pq.push(make_tuple(r1 - l1, d + 1, l1, r1));
        }
        return res;
    }

    // [l, r) に含まれる x 未満の値の個数 O(log(max))
    int less_freq(int l, int r, long long x) {
        if (x <= 0) return 0;
        if (l >= r) return 0;
        if (x >= 1LL << (digit)) return r - l;
        int ans = 0;
        for (int d = 0; d < digit; d++) {
            if ((x >> (digit - 1 - d) & 1) == 1) {
                ans += bit_vectors[d].rank(r, 0) - bit_vectors[d].rank(l, 0);
                l = num_zero[d] + bit_vectors[d].rank(l, 1);
                r = num_zero[d] + bit_vectors[d].rank(r, 1);
            } else {
                l = bit_vectors[d].rank(l, 0);
                r = bit_vectors[d].rank(r, 0);
            }
        }
        return ans;
    }

    // [l, r) に含まれる [a, b) の範囲の値の個数 O(log(max))
    int range_freq(int l, int r, long long a, long long b) {
        return less_freq(l, r, b) - less_freq(l, r, a);
    }

    // [l, r) に含まれる [a, b) の範囲の値の和 O(log(max))
    long long range_sum(int l, int r, long long a, long long b) {
        if (l >= r) return 0;
        long long ans = 0;
        stack<tuple<int, int, int, int>> st;
        st.push(make_tuple(0, 0, l, r)); // d, 範囲内理論最小値, l, r
        while (!st.empty()) {
            int d;
            long long min_value;
            tie(d, min_value, l, r) = st.top();
            st.pop();
            if (d == digit) {
                // 終わり
                if (a <= sorted[l] && sorted[l] < b) {
                    ans += (long long)sorted[l] * (r - l);
                }
                continue;
            }
            // この範囲内に [a, b) の値が無いなら飛ばす
            if (min_value >= b || min_value + (1LL << (digit - d)) <= a)
                continue;
            // この範囲内が全て [a, b) に入るなら累積和
            if (a <= min_value && min_value + (1LL << (digit - d)) <= b) {
                ans += cumulative_sum[d][r] - cumulative_sum[d][l];
                continue;
            }

            int l0 = bit_vectors[d].rank(l, 0);
            int r0 = bit_vectors[d].rank(r, 0);
            int l1 = num_zero[d] + bit_vectors[d].rank(l, 1);
            int r1 = num_zero[d] + bit_vectors[d].rank(r, 1);
            if (l0 < r0) st.push(make_tuple(d + 1, min_value, l0, r0));
            if (l1 < r1)
                st.push(make_tuple(d + 1, min_value + (1LL << (digit - d - 1)),
                                   l1, r1));
        }
        return ans;
    }
};

template <class T>
struct HLDecomposition {
    Graph<T> &g;
    int n;
    vector<vector<int>> chains; // chain の列。head の浅い順
    vector<int> parent;         // 親の頂点番号。根なら -1
    vector<int> subsize;        // 自身を根とする部分木のサイズ
    vector<int> depth;          // 根からの距離
    vector<int> head;           // 自身を含む chain の先頭の頂点
    vector<int> last;           // 自身を含む chain の末尾の頂点
    vector<int> next;           // 自身が属する chain での次の頂点。範囲外なら -1
    vector<int> prev;           // 自身が属する chain での前の頂点。範囲外なら -1
    vector<int> chain;          // 自身が属する chain 番号
    vector<int> idx;            // 自身が属する chain での自身の番号
    vector<int> encode; // 元の頂点番号をパスクエリ用に並べ替えた番号に変える
    vector<int> decode; // パスクエリ用に並べ替えた頂点番号を元の番号に変える

    HLDecomposition(Graph<T> &g_, int r = -1)
        : g(g_), n(g.size()), chains(0), parent(n, 0), subsize(n, 0), depth(n, -1), head(n, 0),
          last(n, 0), next(n, -1), prev(n, -1), chain(n, -1), idx(n, 0), encode(n), decode(n) {
        if (r != -1) decompose(r);
    }

    // 頂点 v が属する chain の親頂点を返す
    // u から根まで登りたいときは
    // for(; u != -1; u = climb(u))
    int climb(int v) const {
        return parent[head[v]];
    }

    // chains[first][second] = v
    std::pair<int, int> get_index(int v) const {
        return std::make_pair(chain[v], idx[v]);
    }

    int size() const {
        return n;
    }

    void decompose(const int root) {
        stack<int> stk; // DFS 用スタック
        stk.push(root);
        parent[root] = -1;
        depth[root] = 0;

        // DFS
        while (!stk.empty()) {
            int v = stk.top();
            stk.pop();
            if (v >= 0) {
                // 行きがけに parent, depth を計算
                stk.push(~v); // 帰りがけ用に反転したものを積んでおく
                for (auto &e : g[v]) {
                    int child = e.to;
                    if (depth[child] == -1) {
                        depth[child] = depth[v] + 1;
                        parent[child] = v;
                        stk.push(child);
                    }
                }
            } else {
                // 帰りがけに subsize を計算し、Heavy Edge を決める
                // next は Heavy Edge の子とする
                int m = 0;
                v = ~v;
                subsize[v] = 1;
                for (auto &e : g[v]) {
                    int child = e.to;
                    if (parent[v] == child) continue;
                    subsize[v] += subsize[child];
                    if (m < subsize[child]) {
                        m = subsize[child];
                        next[v] = child;
                    }
                }
            }
        }

        stk.push(root);
        while (!stk.empty()) {
            int h = stk.top();
            stk.pop();
            for (auto &e : g[h]) {
                if (parent[h] != e.to) stk.push(e.to);
            }

            if (chain[h] != -1) continue;
            chains.push_back(vector<int>());
            vector<int> &path = chains.back();

            // Heavy Edge を辿っていき、chains に追加する
            for (int cur = h; cur != -1;) {
                path.push_back(cur);
                cur = next[cur];
            }

            // 今追加した chain の情報を調べて記録する
            for (int i = 0; i < (int)path.size(); i++) {
                int v = path[i];
                head[v] = path.front();
                last[v] = path.back();
                next[v] = i + 1 != (int)path.size() ? path[i + 1] : -1;
                prev[v] = i != 0 ? path[i - 1] : -1;
                chain[v] = chains.size() - 1;
                idx[v] = i;
            }
        }

        int new_index = 0;
        for (auto path : chains) {
            for (auto v : path) {
                encode[v] = new_index;
                decode[new_index] = v;
                new_index++;
            }
        }
    }

    int lca(int u, int v) {
        // 同じ chain に属するまで、head が深い側の頂点を登らせる
        while (chain[u] != chain[v]) {
            if (depth[head[u]] > depth[head[v]])
                u = climb(u);
            else
                v = climb(v);
        }
        // 同じ chain に来たら、浅い方が LCA
        return depth[u] < depth[v] ? u : v;
    }

    // 頂点が値を持つパスクエリ用の区間列（閉区間）を encode して返す
    // LCA は result.back()[0]（辺が値を持つ場合は LCA を除く）
    vector<pair<int, int>> queries(int u, int v) {
        vector<pair<int, int>> result;
        while (chain[u] != chain[v]) {
            if (depth[head[u]] > depth[head[v]]) {
                result.push_back(make_pair(encode[head[u]], encode[u]));
                u = climb(u);
            } else {
                result.push_back(make_pair(encode[head[v]], encode[v]));
                v = climb(v);
            }
        }
        result.push_back(minmax(encode[u], encode[v]));
        return result;
    }
};

// 辺が値を持つ場合に、子側の頂点に値を下ろす
template <class T>
vector<T> down(Graph<T> &G, int root, T def) {
    int n = G.size();
    vector<T> result(n);
    stack<tuple<int, int, T>> stk;
    stk.push(make_tuple(-1, root, def));
    while (!stk.empty()) {
        int parent, idx;
        T val;
        tie(parent, idx, val) = stk.top();
        stk.pop();
        result[idx] = val;
        for (const auto &e : G[idx]) {
            if (e.to == parent) continue;
            stk.push(make_tuple(idx, e.to, e.cost));
        }
    }
    return result;
}

vll depth;

void dfs(int pos, int par, ll d, Graph<ll> &graph){
    depth[pos] = d;
    for(auto e : graph[pos]){
        if(e.to==par)continue;
        dfs(e.to, pos, d + (e.cost - 1) % 10000 + 1, graph);
    }
}

int main(void) {
    int N,Q;
    cin>>N>>Q;
    depth = vll(N, 0);
    Graph<ll> G(N, false);
    rep(i,N-1){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        a--,b--,c--;
        G.add_edge(a, b, d+10000*c);
    }
    dfs(0, -1, 0, G);
    auto color = down<ll>(G, 0, 0);

    HLDecomposition<ll> hld(G, 0);

    vll color2(N);
    rep(i,N){
        color2[hld.encode[i]] = color[i];
    }
    dump(color2);

    WaveletMatrix wm(color2);

    rep(q,Q){
        int x,y,u,v;
        cin>>x>>y>>u>>v;
        x--,u--,v--;
        auto queries = hld.queries(u,v);
        ll total_num = 0, total_len = 0;
        ll dist = 0;
        rep(i, queries.size()){
            int l, r;
            tie(l, r) = queries[i];
            r++;
            dump(l,r);
            if(i == queries.size()-1){
                dist = depth[u] + depth[v] - 2 * depth[hld.decode[l]];
                l++;
            }
            ll num = wm.range_freq(l, r, 10000*x+1, 10000*(x+1)+1);
            ll len = wm.range_sum(l, r, 10000*x+1, 10000*(x+1)+1)
                - 10000*x*num;
            total_num += num;
            total_len += len;
        }
        dump(dist, total_len, total_num);
        cout << dist - total_len + y * total_num << '\n';
    }

    return 0;
}

Measured memory_bytes: 84832