#include<bits/stdc++.h>
#define re register
#define N 5009
#define M 400009
#define in read()
using namespace std;
inline int read(){
	char ch;int f=1,res=0;
	while((ch=getchar())<'0'||ch>'9') if(ch=='-') f=-1;
	while(ch>='0'&&ch<='9'){
		res=(res<<3)+(res<<1)+ch-'0';
		ch=getchar();
	}
	return f==1?res:-res;
}
int n,m,S,T,ans;
double tot,dis[N];
struct node{int u;double cost;};
bool operator <(const node &a,const node &b){
	return dis[a.u]+a.cost>dis[b.u]+b.cost;
}
int nxt[M],to[M],head[N],cnt=0;
double w[M];
void add(int x,int y,double z){
	nxt[++cnt]=head[x];head[x]=cnt;to[cnt]=y;w[cnt]=z;
}
int Nxt[M],To[M],Head[N],Cnt=0;
double W[M];
void conadd(int x,int y,double z){
	Nxt[++Cnt]=Head[x];Head[x]=Cnt;To[Cnt]=y;W[Cnt]=z;
}
bool vis[N];
void spfa(){
	memset(dis,127,sizeof(dis));
	queue<int > q;q.push(S);dis[S]=0;
	while(!q.empty()){
		int u=q.front();q.pop();vis[u]=0;
		for(int e=Head[u];e;e=Nxt[e]){
			int v=To[e];
			if(dis[v]>dis[u]+W[e]){
				dis[v]=dis[u]+W[e];
				if(!vis[v]) q.push(v),vis[v]=1;
			}
		}
	}
}
priority_queue<node> que;
void Astar(){
	que.push((node){S,0});
	while(!que.empty()){
		node now=que.top();que.pop();
		if(now.u==T){
			tot-=now.cost;
			if(tot<0) return;
			ans++;
			continue;
		}
		for(int e=head[now.u];e;e=nxt[e]){
			int v=to[e];
			que.push((node){v,now.cost+w[e]});
		}
	}
}
int main(){
	n=in;m=in;scanf("%lf",&tot);
	int u,v,i,j,k;
	double len;
	for(i=1;i<=m;++i){
		u=in;v=in;scanf("%lf",&len);
		conadd(v,u,len);add(u,v,len);
	}
	S=n;T=1;
	spfa();//处理出估价函数dis
	ans=0; 
	S=1;T=n;
	Astar();
	cout<<ans;
	return 0;
}