#include <iostream>

#include <string>

#include <cstring>

#include <cstdlib>

#include <cstdio>

#include <cmath>

#include <algorithm>

#include <stack>

#include <queue>

#include <cctype>

#include <vector>

#include <iterator>

#include <set>

#include <map>

#include <sstream>

using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))

#define pf printf

#define sf scanf

#define spf sprintf

#define pb push_back

#define debug printf("!\n")

#define MAXN 1000+5

#define MAX(a,b) a>b?a:b

#define blank pf("\n")

#define LL long long

#define ALL(x) x.begin(),x.end()

#define INS(x) inserter(x,x.begin())

#define pqueue priority_queue

#define INF 0x3f3f3f3f

int n,m;

struct node{int y,val,next;}tree[MAXN<<];

int head[MAXN],vis[MAXN],ptr=,dp[MAXN][MAXN],a[MAXN],vis2[MAXN];

void init()

{

    mem(head,-);

    mem(vis,);

    mem(vis2,);

    mem(dp,);

    ptr=;

}

void add(int x,int y,int val)

{

    tree[ptr].y = y;

    tree[ptr].val = val;

    tree[ptr].next = head[x];

    head[x] = ptr++;

}

int cost;

void dfs(int rt)

{

    vis[rt]=;

    for(int i = ;i<=m;i++) dp[rt][i] = a[rt];

    for(int i = head[rt];i!=-;i=tree[i].next)

    {

        int y = tree[i].y;

        if(vis[y]) continue;

        dfs(y);

        for(int j=m;j>=;j--)

        {

            for(int k=;k<=j;k++)

            {

                if(j-k-*tree[i].val>=)

                    dp[rt][j] = max(dp[rt][j],dp[rt][j-k-*tree[i].val]+dp[y][k]);

            }

        }

    }

}

bool dfs2(int rt)

{

    vis2[rt] = ;

    for(int i = head[rt];i!=-;i=tree[i].next)

    {

        int y = tree[i].y;

        if(vis2[y]) continue;

        if(y==n)

        {

            cost+=tree[i].val;

            return true;

        }

        if(dfs2(y))

        {

            cost+=tree[i].val;

            tree[i].val = ;

            return true;

        }

    }

}

int main()

{

    int i,j,k,t;

    while(~sf("%d%d",&n,&m))

    {

        init();

        cost = ;

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

        {

            int x,y,z;

            sf("%d%d%d",&x,&y,&z);

            add(x,y,z);

            add(y,x,z);

        }

        for(i=;i<=n;i++) sf("%d",&a[i]);

        dfs2();

        if(cost>m)

        {

            pf("Human beings die in pursuit of wealth, and birds die in pursuit of food!\n");

            continue;

        }

        m-=cost;

        dfs();

        pf("%d\n",dp[][m]);

    }

}