#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
#define MAXN   ((ll)(1e5 + 5))
#define all(x) (x).begin(), (x).end()
const ll mod = 998244353;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

struct dsu {
	vector<ll> d;
	ll ans;
	struct info {
		int u, v;
		int pdu, pdv;
		int pans;
	};
	vector<info> undoing;

	dsu(int n) {
		d.resize(n);
		for (int i = 0; i < n; i++)
			d[i] = -1;
		ans = 0;
		undoing = {};
	}

	void undo() {
		assert(!undoing.empty());
		info x = undoing.back();
		undoing.pop_back();
		if (x.u == -1)
			return;
		d[x.u] = x.pdu;
		d[x.v] = x.pdv;
		ans = x.pans;
	}

	int find(int u) {
		if (d[u] < 0)
			return u;
		return find(d[u]);
	}

	void join(int u, int v) {
		u = find(u);
		v = find(v);
		if (u == v) {
			undoing.push_back({-1, -1, -1, -1, -1});
			return;
		}
		if (d[u] > d[v])
			swap(u, v);
		undoing.push_back({u, v, d[u], d[v], ans});

		ans += d[u] * d[v];
		// cout << u << ' ' << v << "\n";
		// cout << ans << ' ' << d[u] << ' ' << d[v] << '\n';
		d[u] += d[v];
		d[v] = u;
	}
};

struct edge {
	int u, v;
	int type;
	int lim, len;
};

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n, m, k;
	cin >> n >> m >> k;
	vector<int> dec;
	for (int i = 0; i < 30; i++)
		if (k & (1 << i))
			dec.push_back(1 << i);
	reverse(all(dec));
	vector<edge> ts;
	for (int i = 0; i < m; i++) {
		int u, v, c;
		cin >> u >> v >> c;
		u--, v--;
		int act = 0;
		// cout << "\n";
		// cout << i << "\n";
		for (int j = 0; j < dec.size(); j++) {
			int x = (c - (c & (dec[j] - 1))) ^ act;
			ts.push_back({u, v, +1, x, dec[j]});
			ts.push_back({u, v, -1, x + dec[j], dec[j]});
			// cout << x << ' ' << x + dec[j] << "\n";
			act |= dec[j];
		}
	}

	sort(all(ts), [&](edge &e1, edge &e2) {
		if (e1.lim != e2.lim) {
			return e1.lim < e2.lim;
		}
		if (e1.type != e2.type) {
			return e1.type < e2.type;
		}
		if (e1.len != e2.len) {
			if (e1.type == +1) {
				return e1.len > e2.len;
			}
			return e1.len < e2.len;
		}
		return true;
	});

	// for (int i = 0; i < ts.size(); i++) {
	// 	cout << ts[i].u << ' ' << ts[i].v << ' ' << ts[i].type << ' '
	// 	     << ts[i].lim << ' ' << ts[i].len << '\n';
	// }

	int q;
	cin >> q;
	vector<pii> tsq;
	for (int i = 0; i < q; i++) {
		int d;
		cin >> d;
		tsq.push_back(pii(d, i));
	}

	sort(all(tsq));

	vector<ll> ans(q);
	dsu ds(n);
	int pos = 0;
	for (int i = 0; i < q; i++) {
		int t = tsq[i].first;
		int id = tsq[i].second;
		// cout << id << '\n';
		while (pos < ts.size() && ts[pos].lim <= t) {
			if (ts[pos].type == +1) {
				// cout << ts[pos].u << ' ' << ts[pos].v << "\n";
				ds.join(ts[pos].u, ts[pos].v);
			} else
				ds.undo();
			pos++;
		}
		ans[id] = ds.ans;
	}

	for (int i = 0; i < q; i++)
		cout << ans[i] << "\n";

	return 0;
}