#include<string.h>
#include <iostream>
#include<stack>
#include<algorithm>
#include<time.h>
#include<queue>
#include<cstdio>
using namespace std;

int n,m;
int map[1001][1001];
int v;
bool ans;
int to;
bool vist[1001];
int set[1001];
vector<int> q[1001];

struct my
{
	int x;
	int y;
	int v;
}
go[1000001];

bool cmp(my a,my b)
{
	return a.v<b.v;
}

int find(int k)
{
	if (set[k]!=k)
		return find(set[k]);
	return k;
}

bool dfs(int from)
{
	//cout<<from<<endl;
	int i,j,k;
	vist[from]=true;
	for (i=0;i<q[from].size();i++)
	{
		if (q[from][i]==to)
		{
			if (map[from][to]<=v)
				return true;
			else
				return false;
		}
		else if (!vist[q[from][i]]&&map[from][q[from][i]]<=v&&dfs(q[from][i]))
			return true;
	}
	return false;
	
}

void dij(int from)
{
	int i,j,k;
	int hi[1001];
	for (i=1;i<=n;i++)
	{
		hi[i]=map[from][i];
	}
	j=from;
	k=n-1;
	while (k--)
	{
		for (i=1;i<=n;i++)
		{
			if (!vist[i]&&hi[i]&&hi[i]<=v)
			{
				j=i;
			}
		}
		if (j==to)
		{
			ans=true;
			return;
		}
		for (i=1;i<=n;i++)
		{
			if (!vist[i]&&map[i][j]&&hi[i]>map[i][j])
				hi[i]=map[i][j];
		}
	}
}

void bfs(int from)
{
	int i,j,k;
	queue<int> q;
	while (!q.empty())
	{
		q.pop();
	}
	q.push(from);
	vist[from]=true;
	while (!q.empty())
	{
		int d=q.front();
		q.pop();
		if (d==to)
		{
			ans=true;
			return;
		}
		for (i=1;i<=n;i++)
		{
			if (!vist[i]&&map[d][i]&&map[d][i]<=v)
			{
				vist[i]=true;
				q.push(i);
			}
		}
	}
}

int main()
{
	freopen("fuck.txt","r",stdin);
	int i,j,k;
	int t;
	scanf("%d",&t);
	int from;
	int num=0;
	while (t--)
	{
		num++;
		scanf("%d%d",&n,&m);
		for (i=1;i<=n;i++)
		{
			for (j=1;j<=n;j++)
			{
				map[i][j]=0;
			}
		}
		for (i=0;i<m;i++)
		{
			scanf("%d%d%d",&go[i].x,&go[i].y,&go[i].v);
		}
		sort(go,go+m,cmp);
		for (i=1;i<=n;i++)
		{
			set[i]=i;
			q[i].clear();
		}
		k=0;
		for (i=0;i<m;i++)
		{
			if (find(go[i].x)!=find(go[i].y))
			{
				set[set[go[i].x]]=set[set[go[i].y]];
				map[go[i].x][go[i].y]=map[go[i].y][go[i].x]=go[i].v;
				q[go[i].x].push_back(go[i].y);
				q[go[i].y].push_back(go[i].x);
			}
		}

		printf("Case #%d:\n",num);
		scanf("%d",&k);
		while (k--)
		{
			scanf("%d%d%d",&from,&to,&v);
			ans=false;
			for (i=1;i<=n;i++)
				vist[i]=false;
			//dfs(from);
			//dij(from);
			//bfs(from);
			if (dfs(from))
				printf("YES\n");
			else
				printf("NO\n");
		}
	}

	return 0;
}