#include<bits/stdc++.h>
using namespace std;
struct node{
	double dis;
    int to, next;
}k[400005], k2[400005];
int head[400005], number, tot, head2[400005], stop, ans, num[5005];
double dis[5005], dis2[5005], Max;
bool vis[5005];
void add(int x, int y, double z){
	k[++number].dis = z;
	k[number].to = y;
	k[number].next = head[x];
	head[x] = number;
}

void add2(int x, int y, double z){
	k2[++tot].dis = z;
	k2[tot].to = y;
	k2[tot].next = head2[x];
	head2[x] = tot;
}
struct point{
	int id; double x;
	friend bool operator <(point x, point y){
		return x.x > y.x;
	}
};
priority_queue<point>q;
void dijkstra(int s){
	memset(dis, 0x3f, sizeof(dis));
	dis[s] = 0;
	q.push((point){s, 0});
	while(!q.empty()){
		point now = q.top();
		q.pop();
		if(vis[now.id] == true) continue;
		vis[now.id] = true;
		for(int i = head[now.id]; i; i = k[i].next){
			int to = k[i].to; double di = k[i].dis;
			if(dis[now.id] + di < dis[to]){
				dis[to] = dis[now.id] + di;
				q.push((point){to, dis[to]});
			}
		}
	}
}

double A_star(int x){
	return dis[x];
}

void dijkstra2(int s, int e){
	memset(dis2, 0x3f, sizeof(dis2));
	memset(vis, 0, sizeof(vis));
	dis2[s] = 0;
    int user = Max / dis[1];
	q.push((point){s, A_star(s)});
	while(!q.empty()){
		point now = q.top();
		q.pop();
		if(now.id == e){
            Max -= now.x;
			if(Max < 0){
                cout << ans << "\n";
                return;
            } 
            ans++;
            continue;
		}
        num[now.id]++;
		for(int i = head2[now.id]; i; i = k2[i].next){
			int to = k2[i].to; double di = k2[i].dis;
            if(di + now.x <= Max)
				q.push((point){to, now.x - A_star(now.id) + A_star(to) + di});
		}
	}
}

int main(){
	int n, m, s, x, y; double z;
	cin >> n >> m >> Max;
	for(int i = 1; i <= m; i++){
		cin >> x >> y >> z;
		add(y, x, z);
		add2(x, y, z);
	}
	dijkstra(n);
    while(!q.empty())q.pop();
	dijkstra2(1, n);
}

A*为啥还又WA又MLE