B

#include <bits/stdc++.h>

using namespace std;

#define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
#define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fill(vec, value) memset(vec, value, sizeof(vec));
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define Pair pair < int, int >
#define ll long long
#define ull unsigned long long
#define Mod  1'000'000'007
#define OO 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)

template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x: v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
    for (const T &x: v) out << x << ' ';
    return out;
}

void AhMeD_HoSSaM(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    freopen("cals.in", "r", stdin);
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
    #endif*/
}

struct Edge {

    int v, w;

    Edge(int V = 0, int W = 0) : v(V), w(W) {}

};

int n, m, k;
vector < vector < Edge > > adj;
vector < vector < ll > > dp;

ll dfs(int u, int cal){
    if(cal >= k) return cal == k;
    ll& ways = dp[u][cal];
    if(~ways) return ways;
    ways = 0;
    for(auto& [v, w] : adj[u])
        ways += dfs(v, cal + w);
    return ways;
}

void Solve(){
    cin >> n >> m >> k;
    adj.resize(n + 1);
    dp.assign(n + 1, vector < ll > (k + 1, 0));
    for(int i = 0, u, v, w; i < m && cin >> u >> v >> w; i++){
        adj[u].push_back(Edge(v, w));
        adj[v].push_back(Edge(u, w));
    }
    cout << dfs(1, 0) << '\n';
}

int main(){
    AhMeD_HoSSaM();
    int t = 1;
    cin >> t;
    while(t--)
        Solve();
    return 0;
}