#include<bits/stdc++.h>

using namespace std;

#define maxn 100006

struct Edge{int to,nxt,w;}edge[maxn<<];

int b[maxn],n,m,a[maxn],head[maxn],tot;

void init(){memset(head,-,sizeof head);tot=;}

void addedge(int u,int v,int w){

    edge[tot].to=v;edge[tot].nxt=head[u];edge[tot].w=w;head[u]=tot++;

}

struct Node{int lc,rc,sum;}T[maxn*];

int siz,rt[maxn];

int build(int l,int r){

    int now=++siz;

    T[now].lc=T[now].rc=T[now].sum=;

    if(l==r)return now;

    int mid=l+r>>;

    T[now].lc=build(l,mid);

    T[now].rc=build(mid+,r);

    return now;

}

int update(int last,int pos,int l,int r){//更新到pos点

    int now=++siz;

    T[now]=T[last];T[now].sum++;

    if(l==r)return now;

    int mid=l+r>>;

    if(pos<=mid)T[now].lc=update(T[last].lc,pos,l,mid);

    else T[now].rc=update(T[last].rc,pos,mid+,r);

    return now;

}

int query(int st,int ed,int L,int R,int l,int r){

    if(L<=l && R>=r)return T[ed].sum-T[st].sum;

    int mid=l+r>>,res=;

    if(L<=mid)res+=query(T[st].lc,T[ed].lc,L,R,l,mid);

    if(R>mid)res+=query(T[st].rc,T[ed].rc,L,R,mid+,r);

    return res;

}    

int f[maxn],son[maxn],d[maxn],size[maxn];

void dfs1(int x,int pre,int deep){

    f[x]=pre;size[x]=;d[x]=deep;

    for(int i=head[x];i!=-;i=edge[i].nxt){

        int y=edge[i].to;

        if(y==pre)continue;

        a[y]=edge[i].w;

        dfs1(y,x,deep+);

        size[x]+=size[y];

        if(size[y]>size[son[x]])son[x]=y;

    }

}

int id[maxn],rk[maxn],idx,top[maxn];

void dfs2(int x,int tp){

    top[x]=tp;id[x]=++idx;rk[idx]=x;

    if(son[x])dfs2(son[x],tp);

    for(int i=head[x];i!=-;i=edge[i].nxt){

        int y=edge[i].to;

        if(y!=son[x] && y!=f[x])dfs2(y,y);

    }

}

int Query(int x,int y,int pos){

       int res=;

    while(top[x]!=top[y]){

        if(d[top[x]]<d[top[y]])swap(x,y);

        res+=query(rt[id[top[x]]-],rt[id[x]],,pos,,m);

        x=f[top[x]];

    }

    if(id[x]>id[y])swap(x,y);

    res+=query(rt[id[x]],rt[id[y]],,pos,,m);

    return res;

}

int main(){int q;init();

    cin>>n>>q;int u,v,w,k;

    for(int i=;i<n;i++){

        scanf("%d%d%d",&u,&v,&w);

        addedge(u,v,w);addedge(v,u,w);

    }

    a[]=0x3f3f3f3f;

    siz=;dfs1(,,);dfs2(,);//树剖

    for(int i=;i<=n;i++)b[++m]=a[i];

    sort(b+,b++m);

    m=unique(b+,b++m)-(b+);

    rt[]=build(,m);

    for(int i=;i<=idx;i++){

        int pos=lower_bound(b+,b++m,a[rk[i]])-b;

        rt[i]=update(rt[i-],pos,,m);

    }

    while(q--){

        scanf("%d%d%d",&u,&v,&k);

        int pos=upper_bound(b+,b++m,k)-(b+);

        if(pos==){puts("");continue;}

        else cout<<Query(u,v,pos)<<'\n';

    }

}