# Original solution
# verified: ABC014-D
# calculate LCA O(logN) for each query

# kprev[k][i]: 2^k parent of node i 
# if there is no node returns "None"
# Depth[i]: Depth of node i from rootNode

class Doubling():
    def __init__(self, graph, rootNode=0):
        self.graph = graph
        self.N = len(graph)
        self.Log_N = (self.N-1).bit_length()
        self.rootNode = rootNode
        # BFS
        self.prev = [None]*self.N
   
        self.Depth = [-1]*self.N
        q = [self.rootNode]
        self.Depth[self.rootNode] = 0
        d = 0
        while q:
            qq = []
            d += 1
            for p in q:
                for np, _, _ in self.graph[p]:
                    if self.Depth[np] == -1:
                        self.prev[np] = p
                        self.Depth[np] = d
                        qq.append(np)
            q = qq

        # construct
        self.kprev = [self.prev]
        S = self.prev
        for k in range(self.Log_N):
            T = [None]*self.N
            for i in range(self.N):
                if S[i] is None:
                    continue
                T[i] = S[S[i]]
            self.kprev.append(T)
            S = T

    # LCA
    def LCAquery(self, u, v):
        dd = self.Depth[v] - self.Depth[u]
        if dd < 0:
            u, v = v, u
            dd = -dd
        
        # set same Depth
        for k in range(self.Log_N+1):
            if dd & 1:
                v = self.kprev[k][v]
            dd >>= 1
        
        if u == v:
            return u
        
        for k in reversed(list(range(self.Log_N))):
            pu = self.kprev[k][u]
            pv = self.kprev[k][v]
            if pu != pv:
                u, v = pu, pv
        
        return self.kprev[0][u]

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
from bisect import bisect_right

N, Q = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(N-1):
    a, b, c, d = list(map(int, input().split()))
    graph[a-1].append((b-1, c, d))
    graph[b-1].append((a-1, c, d))

Query = [list(map(int, input().split())) for _ in range(Q)]

doubling = Doubling(graph)

D = [-1]*N
D[0] = 0
EulerTour = []
Color = [None]*N
Weight = [None]*N
PointFront = [None]*N

def dfs(p):
    PointFront[p] = len(EulerTour)
    EulerTour.append((p, True))
    for np, c, d in graph[p]:
        if D[np] == -1:
            Color[np] = c
            Weight[np] = d
            D[np] = D[p] + d
            dfs(np)
    EulerTour.append((p, False))

dfs(0)
Indexes = [[] for _ in range(N)]
Weights = [[0] for _ in range(N)]
Colors = [[0] for _ in range(N)]
for i, (p, go) in enumerate(EulerTour):
    if p == 0: continue
    w = Weight[p] if go else -Weight[p]
    num = +1 if go else -1
    c = Color[p]
    Weights[c].append(Weights[c][-1]+w)
    Colors[c].append(Colors[c][-1]+num)
    Indexes[c].append(i)

# point までにある color 指定された時のスコア
def fixed_score(point, color, replace):
    ind_euler = PointFront[point]
    ind = bisect_right(Indexes[color], ind_euler)
    return D[point] - Weights[color][ind] + Colors[color][ind]*replace


for x, y, u, v in Query:
    u -= 1; v -= 1
    lca = doubling.LCAquery(u, v)
    u_fixed = fixed_score(u, x, y)
    v_fixed = fixed_score(v, x, y)
    l_fixed = fixed_score(lca, x, y)
    ans = u_fixed + v_fixed - 2*l_fixed
    print(ans)

# Optimized solution
# verified: ABC014-D
# calculate LCA O(logN) for each query

# kprev[k][i]: 2^k parent of node i 
# if there is no node returns "None"
# Depth[i]: Depth of node i from rootNode

class Doubling():
    def __init__(self, graph, rootNode=0):
        self.graph = graph
        self.N = len(graph)
        self.Log_N = (self.N-1).bit_length()
        self.rootNode = rootNode
        # BFS
        self.prev = [None]*self.N
   
        self.Depth = [-1]*self.N
        q = [self.rootNode]
        self.Depth[self.rootNode] = 0
        d = 0
        while q:
            qq = []
            d += 1
            for p in q:
                for np, _, _ in self.graph[p]:
                    if self.Depth[np] == -1:
                        self.prev[np] = p
                        self.Depth[np] = d
                        qq.append(np)
            q = qq

        # construct
        self.kprev = [self.prev]
        S = self.prev
        for k in range(self.Log_N):
            T = [None]*self.N
            for i in range(self.N):
                if S[i] is None:
                    continue
                T[i] = S[S[i]]
            self.kprev.append(T)
            S = T

    # LCA
    def LCAquery(self, u, v):
        dd = self.Depth[v] - self.Depth[u]
        if dd < 0:
            u, v = v, u
            dd = -dd
        
        # set same Depth
        for k in range(self.Log_N+1):
            if dd & 1:
                v = self.kprev[k][v]
            dd >>= 1
        
        if u == v:
            return u
        
        for k in reversed(list(range(self.Log_N))):
            pu = self.kprev[k][u]
            pv = self.kprev[k][v]
            if pu != pv:
                u, v = pu, pv
        
        return self.kprev[0][u]

import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10**6)
from bisect import bisect_right

N, Q = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(N-1):
    a, b, c, d = list(map(int, input().split()))
    graph[a-1].append((b-1, c, d))
    graph[b-1].append((a-1, c, d))

Query = [list(map(int, input().split())) for _ in range(Q)]

doubling = Doubling(graph)

D = [-1]*N
D[0] = 0
EulerTour = [(0, True)]
Color = [None]*N
Weight = [None]*N
PointFront = [None]*N
PointFront[0] = 0

# def dfs(p):
#     PointFront[p] = len(EulerTour)
#     EulerTour.append((p, True))
#     for np, c, d in graph[p]:
#         if D[np] == -1:
#             Color[np] = c
#             Weight[np] = d
#             D[np] = D[p] + d
#             dfs(np)
#     EulerTour.append((p, False))

def dfs2():
    stack = [0]
    while stack:
        p = stack[-1]
        update = False
        for np, c, d in graph[p]:
            if D[np] == -1:
                update = True
                PointFront[np] = len(EulerTour)
                EulerTour.append((np, True))
                Color[np] = c
                Weight[np] = d
                D[np] = D[p] + d
                stack.append(np)
                break
        if not update:
            EulerTour.append((p, False))    
            stack.pop()
            

dfs2()
Indexes = [[] for _ in range(N)]
Weights = [[0] for _ in range(N)]
Colors = [[0] for _ in range(N)]
for i, (p, go) in enumerate(EulerTour):
    if p == 0: continue
    w = Weight[p] if go else -Weight[p]
    num = +1 if go else -1
    c = Color[p]
    Weights[c].append(Weights[c][-1]+w)
    Colors[c].append(Colors[c][-1]+num)
    Indexes[c].append(i)

# point までにある color 指定された時のスコア
def fixed_score(point, color, replace):
    ind_euler = PointFront[point]
    ind = bisect_right(Indexes[color], ind_euler)
    return D[point] - Weights[color][ind] + Colors[color][ind]*replace


for x, y, u, v in Query:
    u -= 1; v -= 1
    lca = doubling.LCAquery(u, v)
    u_fixed = fixed_score(u, x, y)
    v_fixed = fixed_score(v, x, y)
    l_fixed = fixed_score(lca, x, y)
    ans = u_fixed + v_fixed - 2*l_fixed
    print(ans)