#include<map>

#include<set>

#include<cmath>

#include<queue>

#include<stack>

#include<vector>

#include<cstdio>

#include<cassert>

#include<iomanip>

#include<cstdlib>

#include<cstring>

#include<iostream>

#include<algorithm>

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pii pair<int,int>

#define C 0.5772156649

#define pi acos(-1.0)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

using namespace std;

using namespace __gnu_cxx;

const double g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f;

struct edge{

    int to,Next,c;

}e[maxn];

int cnt,head[N];

int sz[N],zx[N],dis[N];

int n,k;

bool vis[N];

void add(int u,int v,int c)

{

    e[cnt].to=v;

    e[cnt].c=c;

    e[cnt].Next=head[u];

    head[u]=cnt++;

}

void init()

{

    cnt=;

    memset(head,-,sizeof head);

    memset(vis,,sizeof vis);

}

void dfssz(int u,int f,int &sum)

{

    sum++;

    sz[u]=;

    for(int i=head[u];~i;i=e[i].Next)

    {

        int x=e[i].to;

        if(x==f||vis[x])continue;

        dfssz(x,u,sum);

        sz[u]+=sz[x];

    }

}

void dfszx(int u,int f,int sum,int &ans,int &id)

{

    zx[u]=sum-sz[u];

    for(int i=head[u];~i;i=e[i].Next)

    {

        int x=e[i].to;

        if(x==f||vis[x])continue;

        dfszx(x,u,sum,ans,id);

        zx[u]=max(zx[u],sz[x]);

    }

    if(ans>zx[u])

    {

        ans=zx[u];

        id=u;

    }

}

int findzx(int root)//找子树的重心

{

    int sum=;

    dfssz(root,-,sum);

    int ans=inf,id=;

    dfszx(root,-,sum,ans,id);

    return id;

}

void dfsdis(int u,int f,vector<int> &son)

{

    for(int i=head[u];~i;i=e[i].Next)

    {

        int x=e[i].to;

        if(x==f||vis[x])continue;

        dis[x]=dis[u]+e[i].c;

        dfsdis(x,u,son);

    }

    son.pb(dis[u]);

}

bool comp(int a,int b)

{

    return dis[a]<dis[b];

}

int ok(vector<int> &son)

{

    sort(son.begin(),son.end());

   // for(int i=0;i<son.size();i++)

   //     cout<<son[i]<<endl;

   // cout<<endl;

    int ans=;

    for(int i=;i<son.size();i++)

    {

        int p=upper_bound(son.begin(),son.end(),k-son[i])-son.begin();

        if(p>)p--;

        if(p<=i)continue;

      //  cout<<p<<endl;

        ans+=p-i;

    }

   // cout<<ans<<"*****"<<endl;

    return ans;

}

void dfsson(int u,int f,vector<int> &son)

{

    son.pb(dis[u]);

    for(int i=head[u];~i;i=e[i].Next)

    {

        int x=e[i].to;

        if(x==f||vis[x])continue;

        dfsson(x,u,son);

    }

}

int solve(int root)

{

    int p=findzx(root);//找该子树的重心

    memset(dis,-,sizeof dis);

    dis[p]=;

    vector<int>son;

    son.clear();

    dfsdis(p,-,son);//求子树中各点到重心的距离

    int ans=ok(son);//满足该子树的dis[x]+dis[y]<=k对数;

  //  if(root==3)cout<<ans<<" ----"<<endl;

    for(int i=head[p];~i;i=e[i].Next)

    {

        int x=e[i].to;

        if(vis[x])continue;

        son.clear();

        dfsson(x,p,son);

        ans-=ok(son);

    }

  //  if(root==3)cout<<ans<<" ****"<<endl;

    vis[p]=;

    for(int i=head[p];~i;i=e[i].Next)

    {

        int x=e[i].to;

        if(vis[x])continue;

        ans+=solve(e[i].to);

        //if(x==3)cout<<solve(e[i].to)<<"......."<<endl;

    }

  //  if(root==3)cout<<p<<" "<<ans<<"+++++++++"<<endl;

    return ans;

}

int main()

{

    ios::sync_with_stdio(false);

    cin.tie();

    while(~scanf("%d%d",&n,&k))

    {

        if(!n&&!k)break;

        init();

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

        {

            int a,b,c;

            scanf("%d%d%d",&a,&b,&c);

            add(a,b,c);

            add(b,a,c);

        }

        printf("%d\n",solve());

    }

    return ;

}

/*******************

4 3

1 2 3

1 3 1

1 4 2

********************/