#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n,m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n,m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sc(n) scanf("%c",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mod(x) ((x)%MOD)
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x&-x)
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read()
{
int ret = 0, sgn = 1;
char ch = getchar();
while(ch < '0' || ch > '9')
{
if(ch == '-')
sgn = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
{
ret = ret*10 + ch - '0';
ch = getchar();
}
return ret*sgn;
}
inline void Out(int a) //Êä³öÍâ¹Ò
{
if(a>9)
Out(a/10);
putchar(a%10+'0');
}
int qpow(int m, int k, int mod)
{
int res = 1, t = m;
while (k)
{
if (k&1)
res = res * t % mod;
t = t * t % mod;
k >>= 1;
}
return res;
}
ll gcd(ll a,ll b)
{
return b==0?a : gcd(b,a%b);
}
ll lcm(ll a,ll b)
{
return a*b/gcd(a,b);
}
const int maxn = 1e5+7;
struct node
{
int l;
int r;
int sum;
} T[maxn*40];
struct edge
{
int to;
int w;
};
int n,m,cnt,root[maxn],x,y,w,k,lg[maxn],fa[maxn][21],dep[maxn],vis[maxn];
vector<int> v;
vector<edge> G[maxn];
int getid(int x)
{
return lower_bound(v.begin(),v.end(),x)-v.begin()+1;
}
void update(int l,int r,int &now,int pre,int pos)
{
T[++cnt]=T[pre];
T[cnt].sum++;
now=cnt;
if(l==r)
return;
int mid=(l+r)/2;
if(pos<=mid)
update(l,mid,T[now].l,T[pre].l,pos);
else
update(mid+1,r,T[now].r,T[pre].r,pos);
}
int query(int l,int r,int x,int y,int k)
{
if(r<=k)
return T[y].sum-T[x].sum;
int mid=(l+r)/2;
if(k<=mid)
return query(l,mid,T[x].l,T[y].l,k);
else
return T[T[y].l].sum-T[T[x].l].sum+query(mid+1,r,T[x].r,T[y].r,k);
}
void dfs(int now,int last)
{
dep[now]=dep[last]+1;
fa[now][0]=last;
for(int i=1; (1<<i)<=dep[now]; i++)
{
fa[now][i]=fa[fa[now][i-1]][i-1];
}
for(int i=0; i<G[now].size(); i++)
{
int t=G[now][i].to;
if(t==last)
continue;
update(1,n,root[t],root[now],getid(G[now][i].w));
dfs(t,now);
}
}
int lca(int x,int y)
{
if(dep[x]>dep[y])
swap(x,y);
while(dep[x]!=dep[y])
{
if(lg[dep[y]-dep[x]]-1>=0)
y=fa[y][lg[dep[y]-dep[x]]-1];
else
y=fa[y][0];
}
if(x==y)
return x;
for(int i=lg[dep[y]]; i>=0; i--)
{
if(fa[x][i]!=fa[y][i])
{
x=fa[x][i];
y=fa[y][i];
}
}
return fa[x][0];
}
int main()
{
scanf("%d %d",&n,&m);
for(int i=1; i<=n; i++)
lg[i]=lg[i-1]+(1<<lg[i-1]==i);
for(int i=0; i<n-1; i++)
{
scanf("%d%d%d",&x,&y,&w);
G[x].push_back({y,w});
G[y].push_back({x,w});
v.push_back(w);
}
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
dfs(1,0);
for(int i=1; i<=m; i++)
{
scanf("%d %d %d",&x,&y,&k);
int pos=upper_bound(v.begin(),v.end(),k)-v.begin();
if(pos)
{
int ans=query(1,n,root[1],root[x],pos)+query(1,n,root[1],root[y],pos)-2*query(1,n,root[1],root[lca(x,y)],pos);
printf("%d\n",ans);
}
else
printf("0\n");
}
return 0;
}
