/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <iostream>
#include <fstream>

#ifndef  _TB
#define _TB

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define RFOR(i, b, a) for(int i = b - 1; i >= a; --i)
#define REP(i, N) FOR(i, 0, N)
#define RREP(i, N) RFOR(i, N, 0)

#define MIN(A, B) ((A) < (B) ? (A) : (B))
#define MAX(A, B) ((A) > (B) ? (A) : (B))
#define ABS(A) ((A) < 0 ? (-(A)) : (A))
#define ALL(V) V.begin(), V.end()
#define SIZE(V) (int)V.size()
#define pb push_back
#define mp make_pair
#define EPS 1e-7
#define Pi 3.14159265358979
#define FILL(a,v) memset(a,v,sizeof(a))

using namespace std;

typedef long long Long;
typedef unsigned long long ULong;
typedef unsigned int Uint;
typedef unsigned char Uchar;
typedef vector <int> VI;
typedef pair <int, int> PII;

#define X first
#define Y second

typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.X >> p.Y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.X << ' ' << p.Y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
ui logceil(int x) { return (ui)(8*sizeof(int)-__builtin_clz(x)); }

namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }

template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};

void fastIO(){ios::sync_with_stdio(false); }

template<typename T, typename... Args>
T max(T t, Args... args){ return max(max<T>(args...), t) ;}

template<typename T, typename... Args>
T min(T t, Args... args){ return min(min<T>(args...), t) ;}

#endif

const int MAXN = 100500;


set<int> targ[MAXN];
map<int, int> cnt[MAXN];
map<int, int> tot[MAXN];


vector<pair<int, PII> > g[MAXN];


int n,q,l;

vector<int> tin, tout;
int timer;
vector <VI> up;

void dfs (int v, int p = 0) {
    tin[v] = ++timer;
    up[v][0] = p;
    for (int i=1; i<=l; ++i)
        up[v][i] = up[up[v][i-1]][i-1];
    for (size_t i=0; i<g[v].size(); ++i) {
        int to = g[v][i].X;
        if (to != p)
            dfs (to, v);
    }
    tout[v] = ++timer;
}

bool upper (int a, int b) {
    return tin[a] <= tin[b] && tout[a] >= tout[b];
}

int lca (int a, int b) {
    if (upper (a, b))  return a;
    if (upper (b, a))  return b;
    for (int i=l; i>=0; --i)
        if (! upper (up[a][i], b))
            a = up[a][i];
    return up[a][0];
}


vector<pair<PII, PII> >  qs;


VI rdist;

VI cnts;
VI totals;

void dfs2(int v, int p, int dist) {
    rdist[v] = dist;

    for (auto c: targ[v]) {
        cnt[v][c] = cnts[c];
        tot[v][c] = totals[c];
    }

    for(auto np: g[v]) {
        if (np.X == p)
            continue;
        int nv = np.X;
        int c = np.Y.X;
        int d = np.Y.Y;

        cnts[c]++;
        totals[c] += d;

        dfs2(nv, v, dist+d);

        totals[c] -= d;
        cnts[c]--;
    }

}

class FColorfulTree {
public:
    void solve(std::istream& in, std::ostream& out) {
        fastIO();

        in >> n >> q;
        REP(i, n) {
            targ[i].clear();
            cnt[i].clear();
            tot[i].clear();
            g[i].clear();
        }

        int a,b,c,d;
        FOR(i,1,n) {
            in >> a >> b >> c >> d;
            --a;    --b;
            g[a].pb({b, {c,d}});
            g[b].pb({a, {c,d}});
        }

        tin.resize (n),  tout.resize (n),  up.resize (n);
        while ((1<<l) <= n)  ++l;
        for (int i=0; i<n; ++i)  up[i].resize (l+1);
        dfs (0);


        qs.clear();

        REP(i, q) {
            in >> c >> d >> a >> b;
            --a;    --b;

            int lc = lca(a,b);

            qs.pb({{a,b}, {c,d}});

            targ[a].insert(c);
            targ[b].insert(c);
            targ[lc].insert(c);
        }

        rdist.resize(n,0);
        cnts.resize(n,0);
        totals.resize(n,0);


        dfs2(0, -1, 0);

        REP(i,q) {
            tie(c,d) = qs[i].Y;
            tie(a,b) = qs[i].X;

            int lc = lca(a,b);

            Long dist = rdist[a] + rdist[b] - 2*rdist[lc];
            int t = tot[a][c] + tot[b][c] - 2*tot[lc][c];
            int cc = cnt[a][c] + cnt[b][c] - 2*cnt[lc][c];

           out << dist - t + cc*d << endl;
        }

    }
};


int main() {
	FColorfulTree solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 72368