#include <bits/stdc++.h>
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
using pii = pair<int, int>;
using i64 = long long;
#define rep(i, a, b) for (int i = a, I = b; i <= I; ++i)
#define per(i, a, b) for (int i = a, I = b; i >= I; --i)
template<typename T> void up(T &x, T y) { if (x < y) x = y; }
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

const int N = 100005, M = N * 30;
int n, m, k, x[N], y[N], z[N], q, tot = 1, ch[M][2];
vector<int> mdf[N];
i64 ans, res[N];
int par[N], siz[N], sx[N], sy[N], top;

int find(int x) {
    while (x != par[x]) x = par[x];
    return x;
}
void merge(int id) {
    int u = find(x[id]), v = find(y[id]);
    if (u == v) return;
    if (siz[u] < siz[v]) swap(u, v);
    par[v] = u;
    ans += 1ll * siz[u] * siz[v];
    siz[u] += siz[v];
    sx[++top] = u, sy[top] = v;
}
void clear(int prv) {
    for (; top > prv; --top) {
        int u = sx[top], v = sy[top];
        siz[u] -= siz[v];
        par[v] = v;
        ans -= 1ll * siz[u] * siz[v];
    }
}

void insert(int id, int x) {
    int p = 1;
    per(i, 29, 0) {
        int &q = ch[p][x >> i & 1];
        if (!q) q = ++tot;
        mdf[q].push_back(id);
        p = q;
    }
}
void solve(int p, int d, vector<pii> qry) {
    if (!p || d == -1) {
        for (auto [_, id] : qry) res[id] = ans;
        return;
    }
    vector<pii> q[2];
    for (const auto &it : qry) q[(it.first >> d & 1)].push_back(it);
    if (k >> d & 1) {
        int prv = top;
        rep(i, 0, 1) {
            if (q[i].empty()) continue;
            for (auto id : mdf[ch[p][i]]) merge(id);
            solve(ch[p][!i], d - 1, q[i]);
            clear(prv);
        }
    } else {
        rep(i, 0, 1) {
            if (q[i].empty()) continue;
            solve(ch[p][i], d - 1, q[i]);
        }
    }
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    cin >> n >> m >> k;
    rep(i, 1, m) {
        cin >> x[i] >> y[i] >> z[i];
        insert(i, z[i]);
    }
    rep(i, 1, n) par[i] = i, siz[i] = 1;

    cin >> q;
    vector<pii> qry;
    rep(i, 1, q) {
        int x; cin >> x;
        qry.push_back({x, i});
    }
    solve(1, 29, qry);
    rep(i, 1, q) cout << res[i] << "\n";

    return 0;
}