#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}

template<class F> struct Data {
  typedef typename F::T T;
  T x;
  Data() : x(F::e) {}
  Data(T x) : x(x) {}
  Data(const Data &a, const Data &b) { x = F::f(a.x,b.x); }
};

template<typename _T> struct SUM {
  typedef _T T;
  static constexpr T e = 0;
  static T f(const T &a, const T &b) { return a+b; }
};

template<class Data, int N>
struct SegTree {
  typedef typename Data::T T;
  typedef Data D;
  int m;
  Data dat[N*4];
  void init(int n) { for (m=1; m<n; m*=2); REP(i,2*m-1) dat[i] = Data(); }
  void setleaf(int idx, const Data &d) { dat[m-1+idx] = d; }
  void finishset() { for (int i=m-2; i>=0; --i) dat[i] = Data(dat[i*2+1],dat[i*2+2]); }
  void init(T *v, int n) { init(n); REP(i,n) setleaf(i,v[i]); finishset(); }
  void init(vector<T> v) { init(v.size()); REP(i,v.size()) setleaf(i,v[i]); finishset(); }
  void change(int k, const Data &d) {
    k += m-1;
    dat[k] = d;
    while(k) {
      k = (k-1)>>1;
      dat[k] = Data(dat[(k<<1)+1],dat[(k<<1)+2]);
    }
  }
  Data query(int a, int b) { return q(a, b, 0, 0, m); }
  Data q(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) return Data();
    if (a <= l && r <= b) return dat[k];
    const Data &ld = q(a, b, k*2+1, l, (l+r)/2);
    const Data &rd = q(a, b, k*2+2, (l+r)/2, r);
    return Data(ld,rd);
  }
};

const int MAX_N = 500000;

typedef SegTree<Data<SUM<int> >, MAX_N> ST;

template<class T, int V>
struct LCA {
  static const int VLOGV = 24;
  struct Edge {
    int t;
    T len;
    int next;
    Edge(){}
    Edge(int t, T len, int next) : t(t),len(len),next(next) {}
  };
  int n;
  Edge edge[2*V+2];
  int head[V];
  int cnt;
  void add_edge(int s, int t, T dist = 1) {
    edge[cnt] = Edge(t,dist,head[s]); head[s] = cnt++;
    edge[cnt] = Edge(s,dist,head[t]); head[t] = cnt++;
  }

  int dep[V], pa[V][VLOGV];
  T dis[V];

  void dfs(int u, int p, int depth, int dist) {
    dep[u] = depth; dis[u] = dist; pa[u][0] = p;
    for (int k=head[u]; k; k=edge[k].next)
      if(edge[k].t != p)
        dfs(edge[k].t, u, depth+1, dist+edge[k].len);
  }

  void init(int _n) {
    n = _n;
    REP(i,n) head[i] = 0;
    cnt = 2;
  }

  void run(int root) {
    REP(i,n) pa[i][0] = dep[i] = -1;
    if (root != -1) dfs(root,-1,0,0);
    else REP(i,n) if (dep[i] == -1) dfs(i,-1,0,0);
    for (int j=1; (1<<j)<n; ++j)
      REP(i,n) if (pa[i][j-1] != -1)
        pa[i][j] = pa[pa[i][j-1]][j-1];
  }

  int lca(int a, int b) {
    if (dep[a] < dep[b]) swap(a,b);
    int tmp = 1;
    for (;(1<<tmp)<=dep[a];++tmp);
    --tmp;
    for (int i=tmp; i>=0; --i)
      if (dep[a] - (1<<i) >= dep[b])
        a = pa[a][i];
    if (a==b) return a;
    for (int i=tmp; i>=0; --i)
      if (pa[a][i] != -1 && pa[a][i] != pa[b][i])
        a = pa[a][i], b = pa[b][i];
    return pa[a][0];
  }

  T dist(int a, int b) {
    T v = lca(a,b);
    return dis[a]+dis[b]-dis[v]*2;
  }
};

ST st,st2;
LCA<int, 200010> lca;

struct P {
  int dst, color, len;
};

vector<P> g[200000];
vector<int> cvs[200000];
vector<int> et;
int findex[200000];

void dfs(int v, int p) {
  findex[v] = et.size();
  FOR(it, g[v]) {
    int u = it->dst;
    if (u == p) continue;
    cvs[it->color].push_back(et.size());
    et.push_back(it->len);
    dfs(u, v);
    cvs[it->color].push_back(et.size());
    et.push_back(-it->len);
  }
}

struct Query {
  int index, x,y,u,v;
};

vector<Query> query[100000];
int ans[100000];

int main() {
  int n, Q;
  while(input(n,Q)) {
    lca.init(n);
    REP(i,n)g[i].clear();
    REP(i,n-1) {
      int a,b,c,d;
      input(a,b,c,d);
      a--;b--;c--;
      g[a].push_back(P{b,c,d});
      g[b].push_back(P{a,c,d});
      lca.add_edge(a, b);
    }
    lca.run(0);
    REP(i,n) cvs[i].clear();
    et.clear();
    dfs(0,-1);
    // cout << et << endl;
    // output(findex, n);
    // cout << lca.lca(4, 8) << endl;
    // cout << lca.lca(3, 2) << endl;
    st.init(et);
    st2.init(et.size());
    REP(i,n) query[i].clear();
    REP(i,Q) {
      int x,y,u,v;
      input(x,y,u,v);
      x--;
      u--;
      v--;
      query[x].push_back(Query({i,x,y,u,v}));
      // int l = lca.lca(u, v);
      // int a = st.query(l, findex[u]).x;
      // int b = st.query(l, findex[v]).x;
      // outputs(u,v,a,b);
    }
    REP(i,n) {
      if (query[i].size() == 0) continue;
      // color = i
      FOR(it, cvs[i]) {
        // cout << *it << "!" << endl;
        st.change(*it, 0);
        if (et[*it] > 0) st2.change(*it, 1);
        else st2.change(*it, -1);
      }
      FOR(it, query[i]) {
        int u = it->u;
        int v = it->v;
        int l = findex[lca.lca(u, v)];
        int u1 = st.query(l, findex[u]).x;
        int v1 = st.query(l, findex[v]).x;
        int u2 = st2.query(l, findex[u]).x;
        int v2 = st2.query(l, findex[v]).x;
        ans[it->index] = u1 + v1 + (u2 + v2) * it->y;
        // outputs(u,v,l,u1,v1,u2,v2);
      }
      FOR(it, cvs[i]) {
        st.change(*it, et[*it]);
        st2.change(*it, 0);
      }
    }
    REP(i,Q) printf("%d\n", ans[i]);
  }
}


Measured memory_bytes: 59788