#include <bits/stdc++.h>

using namespace std;

using i64 = int64_t;

const i64 MOD = (i64)1e9 + 7;

const i64 INF = (i64)1e18 + 7;


template <typename T = i64>
struct Range{
    struct iterator{
        T value;
        const T step, last;
        const T& operator*(){return value;}
        iterator(T value, T step, T last) :
            value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),
            step(step),
            last(last)
        {
        }
        iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}
        bool operator!=(const iterator& x){return value != x.value;}
    };
    const T start, last, step;

    Range(const T start, const T last, const T step = static_cast<T>(1)) :
        start(start),
        last(last),
        step(step)
    {
    }

    Range(const T last) :
        start(0),
        last(last),
        step(1)
    {
    }

    iterator begin(){return iterator(start, step, last);}
    iterator end(){return iterator(last, step, last);}
};

template <typename F>
struct FixPoint{
    const F _f;
    FixPoint(F&& f) : _f(forward<F>(f)){}

    template<typename... Types>
    decltype(auto) operator()(Types&&... args) const{
        return _f(*this, forward<Types>(args)...);
    }
};

template <typename F>
static decltype(auto) makeRec(F&& f){
    return FixPoint<F>(forward<F>(f));
}

template <typename T, T Value = T()>
vector<T> makeVector(size_t x){
    return vector<T>(x, T(Value));
}

template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args){
    return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));
}

template <typename T = i64>
bool chmax(T& a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template <typename T = i64>
bool chmin(T& a, T b){
    if(a > b){
        a = b;
        return true;
    }
    return false;
}

#ifdef TEST
#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); cout << "value = " << x << endl;
#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);
#else
#define vecdump(x)
#define dump(x)
#endif


void _dump(int, string& x){
#ifdef TEST
    cout << x << endl;
#endif
}

template <typename T>
void _dump(bool, T& x){
#ifdef TEST
    cout << x << " ";
#endif
}

template <typename T, typename U = typename T::iterator>
void _dump(int, T& x){
#ifdef TEST
    for(auto& elm : x)
        _dump(0, elm);

    cout << endl;
#endif
}

template <typename T>
void _dump_macro(T& x){
    _dump(0, x);
}

void _input(int, string& x){
    cin >> x;
}

template <typename T>
void _input(bool, T& x){
    cin >> x;
}

template <typename T, typename U = typename T::iterator>
void _input(int, T& x){

    for(auto& elm : x)
        _input(0, elm);
}

template <typename T>
void input_single(T& x){
    _input(0, x);
}

auto input(){}

template <typename T, typename... Types>
void input(T& value, Types&&... args){
    input_single(value);
    input(forward<Types>(args)...);
};

void _pararell_input(size_t){}

template <typename T, typename... Types>
void _pararell_input(size_t index, T& value, Types&&... args){
    input(value[index]);
    _pararell_input(index, forward<Types>(args)...);
}

template <typename... Types>
void pararell_input(size_t count, Types&&... args){
    for(const auto& i : Range<>(count))
        _pararell_input(i, forward<Types>(args)...);
}


template<typename T>
struct Segtree{
    i64 n;
    T op;
    vector<T> elm;
    function<T(T, T)> f;

    Segtree(i64 n, T init, function<T(T, T)> f, T op = T()) :
        n(n),
        op(op),
        elm(2 * n, init),
        f(f)
    {
        for(i64 i = n - 1; i >= 1; --i)
            elm[i] = f(elm[2 * i], elm[2 * i + 1]);
    }

    Segtree(i64 n, vector<T> init, function<T(T, T)> f, T op = T()) :
        n(n),
        op(op),
        elm(2 * n),
        f(f)
    {
        for(i64 i = 0; i < n; ++i)
            elm[i + n] = init[i];
        for(i64 i = n - 1; i >= 1; --i)
            elm[i] = f(elm[2 * i], elm[2 * i + 1]);
    }

    void set(i64 x, T val){
        x += n;
        elm[x] = val;
        while(x >>= 1)
            elm[x] = f(elm[2 * x], elm[2 * x + 1]);
    }

    void update(i64 x, T val){
        x += n;
        elm[x] = f(val, elm[x]);
        while(x >>= 1)
            elm[x] = f(elm[2 * x], elm[2 * x + 1]);
    }

    T get(i64 x, i64 y) const{
        T l = op, r = op;
        for(x += n, y += n - 1; x <= y; x >>= 1, y >>= 1){
            if(x & 1)
                l = f(l, elm[x++]);
            if(!(y & 1))
                r = f(elm[y--], r);
        }
        return f(l, r);
    }
};

class HeavyLightDecomposition{
public:
    i64 n;
    vector<vector<i64>> g;
    vector<i64> rev, in, out, nxt, rin, size, depth;

    HeavyLightDecomposition(vector<vector<i64>>& inp) :
        n(inp.size()),
        g(n),
        rev(n, 0),
        in(n, 0),
        out(n, 0),
        nxt(n, 0),
        rin(n, 0),
        size(n, 0),
        depth(n, -1)
    {

        function<void(i64, i64)> dfs_ed = [&](i64 pos, i64 dep){
            depth[pos]=dep;
            for(auto ed : inp[pos])
                if(depth[ed] == -1){
                    g[pos].emplace_back(ed);
                    rev[ed] = pos;
                    dfs_ed(ed, dep + 1);
                }
        };
        dfs_ed(0, 0);

        function<void(i64)> dfs_sz = [&](i64 v){
            size[v] = 1;
            for(auto &u: g[v]){
                dfs_sz(u);
                size[v] += size[u];
                if(size[u] > size[g[v][0]])
                    swap(u, g[v][0]);
            }
        };
        dfs_sz(0);

        i64 t = 0;

        function<void(i64)> dfs_hld = [&](i64 v){
            in[v] = t++;
            rin[in[v]] = v;
            for(auto u: g[v]){
                nxt[u] = (u == g[v][0] ? nxt[v] : u);
                dfs_hld(u);
            }
            out[v] = t;
        };
        dfs_hld(0);
    }

    pair<i64,i64> subtree(i64 x){
        return make_pair(in[x], out[x]);
    }

    vector<i64> subtree_path(i64 x){
        return vector<i64>(next(rin.begin(), in[x]), next(rin.begin(), out[x]));
    }

    pair<i64,i64> subsegment(i64 x){
        return make_pair(in[nxt[x]], in[x] + 1);
    }

    vector<i64> subsegment_path(i64 x){
        return vector<i64>(next(rin.begin(), in[nxt[x]]), next(rin.begin(), in[x] + 1));
    }

    vector<pair<i64,i64>> root_path_query(i64 x){
        vector<pair<i64,i64>> ret;
        ret.emplace_back(subsegment(x));
        while(ret.back().first)
            ret.emplace_back(subsegment(rev[rin[ret.back().first]]));

        return ret;
    }

    i64 lca(i64 x, i64 y){

        i64 sx = rin[subsegment(x).first];
        i64 sy = rin[subsegment(y).first];
        while(sx != sy){
            if(depth[sx] > depth[sy])
                x = rev[sx];
            else
                y = rev[sy];
            sx = rin[subsegment(x).first];
            sy = rin[subsegment(y).first];
        }

        return depth[x] < depth[y] ? x : y;
    }

    pair<vector<pair<i64,i64>>,vector<pair<i64,i64>>> two_point_path(i64 x, i64 y){
        i64 z = lca(x, y);
        pair<i64,i64> z_par = subsegment(z);

        vector<pair<i64,i64>> ret_x;
        ret_x.emplace_back(subsegment(x));

        while(ret_x.back().first != z_par.first)
            ret_x.emplace_back(subsegment(rev[rin[ret_x.back().first]]));

        ret_x.back().first = in[z];

        vector<pair<i64,i64>> ret_y;
        ret_y.emplace_back(subsegment(y));

        while(ret_y.back().first != z_par.first)
            ret_y.emplace_back(subsegment(rev[rin[ret_y.back().first]]));

        ret_y.back().first = in[z] + 1;

        return make_pair(ret_x, ret_y);
    }


};



i64 solve(i64 _count){

    i64 n = 0;
    input(n);

    if(!static_cast<bool>(cin))
        return MOD;
#ifdef TEST
    cout << "Case: " << _count << endl;
#endif
    i64 q;
    input(q);
    vector<i64> a(n - 1), b(n - 1), c(n - 1), d(n - 1);
    pararell_input(n - 1, a, b, c, d);
    for(auto& x : a)
        --x;
    for(auto& x : b)
        --x;
    for(auto& x : c)
        --x;

    vector<vector<i64>> col_rev(n);
    for(i64 i = 0; i < n - 1; ++i)
        col_rev[c[i]].emplace_back(i);

    struct S{
        i64 idx, from, to, cost;
        S(i64 i, i64 f, i64 t, i64 c) : idx(i), from(f), to(t), cost(c){}
    };
    vector<vector<S>> query(n);
    for(i64 i = 0; i < q; ++i){
        i64 x, y, u, v;
        input(x, y, u, v);
        --x, --u, --v;
        query[x].emplace_back(i, u, v, y);
    }

    vector<vector<i64>> edges(n);
    vector<vector<i64>> edges_idx(n);
    vector<i64> ans(q, INF + 1928);
    for(i64 i = 0; i < n - 1; ++i){
        edges[a[i]].emplace_back(b[i]);
        edges[b[i]].emplace_back(a[i]);
        edges_idx[a[i]].emplace_back(i);
        edges_idx[b[i]].emplace_back(i);
    }

    vector<i64> edge_par(n - 1, -1), edge_chi(n - 1, -1);
    function<void(i64)> f = [&](i64 pos){
        for(auto& idx : edges_idx[pos]){
            if(edge_par[idx] == -1){
                edge_par[idx] = pos;
                if(a[idx] == pos)
                    edge_chi[idx] = b[idx];
                else
                    edge_chi[idx] = a[idx];
                f(edge_chi[idx]);
            }
        }
    };
    f(0);

    Segtree<i64> cnt_seg(n, 0, [](auto x, auto y){return x + y;}, 0);
    Segtree<i64> cost_seg(n, 0, [](auto x, auto y){return x + y;}, 0);
    HeavyLightDecomposition hld(edges);
    for(i64 i = 0; i < n - 1; ++i)
        cost_seg.set(hld.in[edge_chi[i]], d[i]);
    for(i64 i = 0; i < n; ++i){
        auto& qs = query[i];
        for(auto& idx : col_rev[i]){
            cnt_seg.set(hld.in[edge_chi[idx]], 1);
            cost_seg.set(hld.in[edge_chi[idx]], 0);
        }
        for(auto& s : qs){
            auto path = hld.two_point_path(s.from, s.to);

            i64 cost = 0;
            i64 cnt = 0;
            for(auto& p : path.first){
                cost += cost_seg.get(p.first, p.second);
                cnt += cnt_seg.get(p.first, p.second);
            }
            for(auto& p : path.second){
                cost += cost_seg.get(p.first, p.second);
                cnt += cnt_seg.get(p.first, p.second);
            }
            int tar = hld.in[hld.lca(s.from, s.to)];
            cost -= cost_seg.get(tar, tar + 1);
            cnt -= cnt_seg.get(tar, tar + 1);
            ans[s.idx] = cost + cnt * s.cost;
        }
        for(auto& idx : col_rev[i]){
            cnt_seg.set(hld.in[edge_chi[idx]], 0);
            cost_seg.set(hld.in[edge_chi[idx]], d[idx]);
        }
    }

    for(auto& x : ans)
        cout << x << endl;


    return 0;
}


signed main(){

    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int t = 0;
    while(solve(++t) != MOD);
}


Measured memory_bytes: 48240