#include<cstdio>
#include<iostream>
#include<vector>
#include<utility>
#define RI register int
#define CI const int&
using namespace std;
typedef pair <int,int> pi;
const int N=100005,P=30;
struct Data
{
	int x,y,szy;
	inline Data(CI X=0,CI Y=0,CI SZY=0)
	{
		x=X; y=Y; szy=SZY;
	}
}stk[N*P]; int n,m,k,x[N],y[N],z[N],q,p,top,fa[N],sz[N]; long long ret,ans[N];
inline int getfa(CI x)
{
	return fa[x]!=x?getfa(fa[x]):x;
}
inline long long C2(CI x)
{
	return 1LL*x*(x-1)/2LL;
}
inline void merge(int x,int y)
{
	x=getfa(x); y=getfa(y); if (x==y) return;
	if (sz[x]>sz[y]) swap(x,y); stk[++top]=Data(x,y,sz[y]);
	fa[x]=y; ret-=C2(sz[x]); ret-=C2(sz[y]); sz[y]+=sz[x]; ret+=C2(sz[y]);
}
inline void revoke(CI tmp)
{
	while (top>tmp)
	{
		int x=stk[top].x,y=stk[top].y,szy=stk[top].szy;
		--top; fa[x]=x; ret-=C2(sz[y]); sz[y]=szy; ret+=C2(sz[x]); ret+=C2(sz[y]);
	}
}
class Trie
{
	private:
		int ch[N*P][2],tot; vector <int> id[N*P]; vector <pi> v[N*P];
	public:
		inline Trie() { tot=1; }
		inline void insert(CI x,CI num,CI now=1,CI y=P-1)
		{
			if (!~y) return id[now].push_back(num); int d=(x>>y)&1;
			if (!ch[now][d]) ch[now][d]=++tot; insert(x,num,ch[now][d],y-1);
		}
		inline void apply(CI now,const pi& it)
		{
			v[now].push_back(it);
		}
		inline void solve(CI k,CI w,const pi& it,CI now=1,CI y=P-1)
		{
			if (!~y||!now) return; int d=(k>>y)&1;
			if (d) apply(ch[now][(w>>y)&1],it);
			solve(k,w,it,ch[now][d^((w>>y)&1)],y-1);
		}
		inline void travel(CI now=1,CI y=P-1)
		{
			if (!now) return; int tmp=top; for (auto [x,y]:v[now]) merge(x,y);
			if (!~y)
			{
				for (int it:id[now]) ans[it]=ret; return revoke(tmp);
			}
			travel(ch[now][0],y-1); travel(ch[now][1],y-1); revoke(tmp);
		}
}T;
int main()
{
	//freopen("CODE.in","r",stdin); freopen("CODE.out","w",stdout);
	RI i; for (scanf("%d%d%d",&n,&m,&k),i=1;i<=m;++i)
	scanf("%d%d%d",&x[i],&y[i],&z[i]);
	for (scanf("%d",&q),i=1;i<=q;++i) scanf("%d",&p),T.insert(p,i);
	for (i=1;i<=m;++i) T.solve(k,z[i],pi(x[i],y[i]));
	for (i=1;i<=n;++i) fa[i]=i,sz[i]=1;
	for (T.travel(),i=1;i<=q;++i) printf("%lld\n",ans[i]);
	return 0;
}