#include <bits/stdc++.h>
using namespace std;
 
typedef pair<int,int > pp;
typedef long long ll;
 
#define sz(x) (int)x.size() 
int const N=5e5+10;

int n,q;
int dep[N],dp[N][20],cost[N],freq[N],cc[N];
vector<vector<int > > adj[N];
vector<vector<int > > qs;
set<int > pq[N];
map<int,pp > sv[N];
void dfs(int u,int p){
	dp[u][0]=p;
	for(auto v:adj[u]){
		if(v[0]==p)continue;
		dep[v[0]]=dep[u]+1;
		cost[v[0]]=cost[u]+v[2];
		dfs(v[0],u);
	}
}

void DFS(int u,int p){
	for(auto r:pq[u])sv[u][r] = {freq[r],cc[r]};
	for(auto v:adj[u]){
		if(v[0]==p)continue;
		freq[v[1]]++;
		cc[v[1]]+=v[2];
		DFS(v[0],u);
		freq[v[1]]--;
		cc[v[1]]-=v[2];
	}
}
int LCA(int a,int b){
	if(dep[b]<dep[a])swap(b,a);
	for(int i=18;i>-1;i--)if(dep[b]-(1<<i)>=dep[a])b=dp[b][i];
	if(a==b)return a;
	for(int i=18;i>-1;i--)if(dp[a][i]!=dp[b][i])b=dp[b][i],a=dp[a][i];
	return dp[b][0];
}
int getCost(int a,int b){
	return cost[a]+cost[b]-2*cost[LCA(a,b)];
}
int main() {
	scanf("%d%d",&n,&q);
	for(int i=0;i<n-1;i++){
		int a,b,c,d;
		scanf("%d%d%d%d",&a,&b,&c,&d);
		adj[a].push_back({b,c,d});
		adj[b].push_back({a,c,d});		
	}
	dfs(1,0);
	for(int j=1;j<19;j++)for(int i=1;i<=n;i++)dp[i][j]=dp[dp[i][j-1]][j-1];
	for(int i=0;i<q;i++){
		int x,y,u,v;
		scanf("%d%d%d%d",&x,&y,&u,&v);
		qs.push_back({x,y,u,v});
		int lca=LCA(u,v);
		pq[lca].insert(x);
		pq[u].insert(x);
		pq[v].insert(x);				
	}
	DFS(1,0);
	for(int i=0;i<q;i++){
		int x=qs[i][0],y=qs[i][1],u=qs[i][2],v=qs[i][3],lca;
		lca=LCA(u,v);
		printf("%d\n",getCost(u,v)-(sv[u][x].second+sv[v][x].second-2*sv[lca][x].second)+
			(sv[u][x].first+sv[v][x].first-2*sv[lca][x].first)*y);
	}
    return 0;
}


### Prompt

Generate a Cpp solution to the following problem:

There is a tree with N vertices numbered 1 to N. The i-th edge in this tree connects Vertex a_i and Vertex b_i, and the color and length of that edge are c_i and d_i, respectively. Here the color of each edge is represented by an integer between 1 and N-1 (inclusive). The same integer corresponds to the same color, and different integers correspond to different colors.

Answer the following Q queries:

* Query j (1 \leq j \leq Q): assuming that the length of every edge whose color is x_j is changed to y_j, find the distance between Vertex u_j and Vertex v_j. (The changes of the lengths of edges do not affect the subsequent queries.)

Constraints

* 2 \leq N \leq 10^5
* 1 \leq Q \leq 10^5
* 1 \leq a_i, b_i \leq N
* 1 \leq c_i \leq N-1
* 1 \leq d_i \leq 10^4
* 1 \leq x_j \leq N-1
* 1 \leq y_j \leq 10^4
* 1 \leq u_j < v_j \leq N
* The given graph is a tree.
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N Q
a_1 b_1 c_1 d_1
:
a_{N-1} b_{N-1} c_{N-1} d_{N-1}
x_1 y_1 u_1 v_1
:
x_Q y_Q u_Q v_Q


Output

Print Q lines. The j-th line (1 \leq j \leq Q) should contain the answer to Query j.

Example

Input

5 3
1 2 1 10
1 3 2 20
2 4 4 30
5 2 1 40
1 100 1 4
1 100 1 5
3 1000 3 4


Output

130
200
60

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
 
typedef pair<int,int > pp;
typedef long long ll;
 
#define sz(x) (int)x.size() 
int const N=5e5+10;

int n,q;
int dep[N],dp[N][20],cost[N],freq[N],cc[N];
vector<vector<int > > adj[N];
vector<vector<int > > qs;
set<int > pq[N];
map<int,pp > sv[N];
void dfs(int u,int p){
	dp[u][0]=p;
	for(auto v:adj[u]){
		if(v[0]==p)continue;
		dep[v[0]]=dep[u]+1;
		cost[v[0]]=cost[u]+v[2];
		dfs(v[0],u);
	}
}

void DFS(int u,int p){
	for(auto r:pq[u])sv[u][r] = {freq[r],cc[r]};
	for(auto v:adj[u]){
		if(v[0]==p)continue;
		freq[v[1]]++;
		cc[v[1]]+=v[2];
		DFS(v[0],u);
		freq[v[1]]--;
		cc[v[1]]-=v[2];
	}
}
int LCA(int a,int b){
	if(dep[b]<dep[a])swap(b,a);
	for(int i=18;i>-1;i--)if(dep[b]-(1<<i)>=dep[a])b=dp[b][i];
	if(a==b)return a;
	for(int i=18;i>-1;i--)if(dp[a][i]!=dp[b][i])b=dp[b][i],a=dp[a][i];
	return dp[b][0];
}
int getCost(int a,int b){
	return cost[a]+cost[b]-2*cost[LCA(a,b)];
}
int main() {
	scanf("%d%d",&n,&q);
	for(int i=0;i<n-1;i++){
		int a,b,c,d;
		scanf("%d%d%d%d",&a,&b,&c,&d);
		adj[a].push_back({b,c,d});
		adj[b].push_back({a,c,d});		
	}
	dfs(1,0);
	for(int j=1;j<19;j++)for(int i=1;i<=n;i++)dp[i][j]=dp[dp[i][j-1]][j-1];
	for(int i=0;i<q;i++){
		int x,y,u,v;
		scanf("%d%d%d%d",&x,&y,&u,&v);
		qs.push_back({x,y,u,v});
		int lca=LCA(u,v);
		pq[lca].insert(x);
		pq[u].insert(x);
		pq[v].insert(x);				
	}
	DFS(1,0);
	for(int i=0;i<q;i++){
		int x=qs[i][0],y=qs[i][1],u=qs[i][2],v=qs[i][3],lca;
		lca=LCA(u,v);
		printf("%d\n",getCost(u,v)-(sv[u][x].second+sv[v][x].second-2*sv[lca][x].second)+
			(sv[u][x].first+sv[v][x].first-2*sv[lca][x].first)*y);
	}
    return 0;
}


```