//#include <bits/stdc++.h>

#include <iostream>
#include <algorithm>

#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>

#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

#include<memory>


using namespace std;
//#define int long long

typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double,int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
//const ll mod = 998244353;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false

//debug
#define DEBUG

#define DUMPOUT cerr

#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() {DUMPOUT << endl;};

template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}

//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

vector<int> ans(100000 + 5);
map<pii, int> color_e, cost;

struct query_info {
  int i;
  int v;
  int fix_c;
  int fix_d;
  query_info(int i, int v, int fix_c, int fix_d) : i(i), v(v), fix_c(fix_c), fix_d(fix_d)
  {}
};

vector<vector<query_info>> query(100000 + 5);

struct TCD {
  int ret;//ans
  vector<vector<int>> g;
  int n;//g.size()
  int centroid;
  vector<bool> dead;
  vector<int> par, sub;

  TCD(int n)
  : n(n),
    g(n),
    ret(0),
    par(n),
    centroid(-1),
    dead(n),
    sub(n)
    {}

  void add_edge(int a, int b) {
    g[a].push_back(b);
    g[b].push_back(a);
  }

  void calc_sub(int r) {
    stack<pii> st;
    par[r] = -1;
    st.emplace(r, 0);
    while (!st.empty()) {
      int now = st.top().first;
      int &i = st.top().second;
      if (i < g[now].size()) {
        int nx = g[now][i++];
        if (nx == par[now] || dead[nx]) continue;
        par[nx] = now;
        st.emplace(nx, 0);
      }
      else {
        st.pop();
        sub[now] = 1;
        for (auto nx : g[now]) {
          if (nx == par[now] || dead[nx]) continue;
          sub[now] += sub[nx];
        }
      }
    }
  }

  int search(int now, int par, int m) {
    for (auto nx : g[now]) {
      if (nx == par || dead[nx]) continue;
      if (sub[nx] > m / 2) {
        return search(nx, now, m);
      }
    }
    return centroid = now;
  }

  void get_centroid(int root) {
    calc_sub(root);
    int m = sub[root];
    search(root, -1, m);
  }

  void coloring(int now, int par, int color, map<int, int>& color_v) {
    color_v[now] = color;
    for (auto nx : g[now]) {
      if (dead[nx] || par == nx) continue;
      coloring(nx, now, color, color_v);
    }
  }

  void dfs(int now, int par, int dist, map<int, pii>& cnt_dist, map<int, int>& color_v) {
    for (auto q : query[now]) {
      if (q.v == centroid) {
        ans[q.i] += dist - cnt_dist[q.fix_c].se + cnt_dist[q.fix_c].fi * q.fix_d;
        continue;
      }
      if (color_v.find(q.v) == color_v.end()) continue;
      if (color_v[now] == color_v[q.v]) continue;
      ans[q.i] += dist - cnt_dist[q.fix_c].se + cnt_dist[q.fix_c].fi * q.fix_d;
    }
    for (auto nx : g[now]) {
      if (nx == par || dead[nx]) continue;
      dist += cost[{min(nx, now), max(nx, now)}];
      cnt_dist[color_e[{min(nx, now), max(nx, now)}]].fi++;
      cnt_dist[color_e[{min(nx, now), max(nx, now)}]].se += cost[{min(nx, now), max(nx, now)}];
      dfs(nx, now, dist, cnt_dist, color_v);
      dist -= cost[{min(nx, now), max(nx, now)}];
      cnt_dist[color_e[{min(nx, now), max(nx, now)}]].fi--;
      cnt_dist[color_e[{min(nx, now), max(nx, now)}]].se -= cost[{min(nx, now), max(nx, now)}];
    }
  }

  void via_centroid(int depth) {
    int color = 1;
    map<int, int> color_v;
    for (auto nx : g[centroid]) {
      if (dead[nx]) continue;
      coloring(nx, centroid, color++, color_v);
    }
    for (auto nx : g[centroid]) {
      if (dead[nx]) continue;
      map<int, pair<int, int>> cnt_dist;
      int dist = cost[{min(nx, centroid), max(nx, centroid)}];
      cnt_dist[color_e[{min(nx, centroid), max(nx, centroid)}]].fi++;
      cnt_dist[color_e[{min(nx, centroid), max(nx, centroid)}]].se += cost[{min(nx, centroid), max(nx, centroid)}];
      dfs(nx, centroid, dist, cnt_dist, color_v);
    }
  }

  int divide_conquer(int root, int depth) {
    get_centroid(root);
    dead[centroid] = true;
    //重心を経由(重心が端点も含む)して複数の部分木同士の計算
    via_centroid(depth);
    //個別の部分木に対してそれぞれ計算(より小さいサイズで同じ計算)
    for (auto nx : g[centroid]) {
      if (dead[nx]) continue;
      divide_conquer(nx, depth + 1);
    }

    dead[centroid] = false;
    return ret;
  }
};

int n, Q;

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> Q;
  TCD tree(n);
  rep(i, n - 1) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    a--; b--;
    if (a > b) swap(a, b);
    tree.add_edge(a, b);
    color_e[{a, b}] = c;
    cost[{a, b}] = d;
  }
  rep(i, Q) {
    int x, y, u, v;
    cin >> x >> y >> u >> v;
    u--; v--;
    query[u].emplace_back(i, v, x, y);
    query[v].emplace_back(i, u, x, y);
  }
  tree.divide_conquer(0, 0);
  rep(i, Q) {
    cout << ans[i] << endl;
  }
}


Measured memory_bytes: 43104