#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

struct edge {
	int to, cost;
};
vector<edge> G[2000];
ll dp[2001];

ll sdp[2001][2];
ll cdp[2001][2];
void solve() {
	int n, m, k; cin >> n >> m >> k;
	rep(i, m) {
		int a, b, c; cin >> a >> b >> c; a--; b--;
		G[a].push_back({ b,c });
		G[b].push_back({ a,c });
	}
	fill(dp, dp + n + 1, -INF);
	dp[0] = 0;
	vector<bool> used(n, false);
	rep(i, n) {
		if (used[i])continue;
		vector<int> ids;
		queue<int> q;
		ids.push_back(i); q.push(i); used[i] = true;
		while (!q.empty()) {
			int id = q.front(); q.pop();
			for (edge e : G[id]) {
				if (used[e.to])continue;
				used[e.to] = true;
				ids.push_back(e.to);
				q.push(e.to);
			}
		}
		int root = i;
		for (int id : ids) {
			if (G[id].size() == 1)root = id;
		}
		vector<int> z;
		int pre = -1;
		int cur = root;
		int len = ids.size();
		rep(j, len - 1) {
			int to = G[cur][0].to;
			int c = G[cur][0].cost;
			if (to == pre)to = G[cur][1].to,c=G[cur][1].cost;
			pre = cur; cur = to; z.push_back(c);
		}
		rep(j, len + 1) {
			rep(k, 2) {
				sdp[j][k] = -INF;
			}
		}

		//don't take first
		sdp[0][0] = 0;
		rep(j, len - 1) {
			int c = z[j];
			rep(x, len + 1)rep(y, 2)cdp[x][y] = -INF;
			rep(x, j + 2) {
				//take
				cdp[x + 1][1] = max(cdp[x + 1][1], sdp[x][0]);
				if (c != 0)cdp[x + 1][1] = max(cdp[x + 1][1], sdp[x][1] + c);
				//not take
				cdp[x][0] = max(cdp[x][0], max(sdp[x][0], sdp[x][1]));
			}
			rep(x, len + 1)rep(y, 2)sdp[x][y] = cdp[x][y];
		}
		vector<ll> nex(len + 1, -INF);
		rep(x, len + 1)rep(y, 2) {
			nex[x] = max(nex[x], sdp[x][y]);
		}
		//take first
		rep(j, len + 1) {
			rep(k, 2) {
				sdp[j][k] = -INF;
			}
		}
		sdp[1][1] = 0;
		rep(j, len - 1) {
			int c = z[j];
			rep(x, len + 1)rep(y, 2)cdp[x][y] = -INF;
			rep(x, j + 2) {
				//take
				cdp[x + 1][1] = max(cdp[x + 1][1], sdp[x][0]);
				if (c != 0)cdp[x + 1][1] = max(cdp[x + 1][1], sdp[x][1] + c);
				//not take
				cdp[x][0] = max(cdp[x][0], max(sdp[x][0], sdp[x][1]));
			}
			rep(x, len + 1)rep(y, 2)sdp[x][y] = cdp[x][y];
		}
		rep(x, len + 1){
			nex[x] = max(nex[x], sdp[x][0]);
			if (G[root].size()==2&&G[root][1].cost != 0) {
				nex[x] = max(nex[x], sdp[x][1] + G[root][1].cost);
			}
			else if (G[root].size() <= 1) {
				nex[x] = max(nex[x], sdp[x][1]);
			}
		}
		/*cout << "hello " << i << endl;
		rep(j, len + 1) {
			cout << nex[j] << endl;
		}*/
		//dp part
		per(y, n + 1) {
			per(x, len + 1) {
				if (x + y > n)continue;
				dp[x + y] = max(dp[x + y], nex[x] + dp[y]);
			}
		}
	}
	ll ans = dp[k];
	if (ans <=-INF/2) {
		cout << "Impossible" << endl;
	}
	else {
		cout << ans << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	init_f();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}



Measured memory_bytes: 19756