#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 2000 + 10;
struct node{
	node() {
	}
	node(int y, int val) {
		this->y = y;
		this->val = val; 
	}
	int y, val;
};
vector<node> e[maxn];
int n, l, Q;
char s[maxn * 2];
int t[maxn];
int deg[maxn];
int getnum(char a, char b)
{
	return (a - 48) * 50 + b - 48; 
}
void check_p(int id)
{
	for (int i = 1; i <= n; i++)
		deg[i] = 0;
	for (int i = 1; i <= n; i++)
		deg[t[i]]++;
	int deg0 = -1, deg2 = -1;
	for (int i = 1; i <= n; i++)
	{
		if (deg[i] == 0)
		{
			if (deg0 != -1) return;
			deg0 = i;
		}
		if (deg[i] == 2)
		{
			if (deg2 != -1) return;
			deg2 = i;
		} 
		if (deg[i] > 2) return;
	}
	if (deg0 != -1 && deg2 != -1)
	{
		for (int i = 1; i <= n; i++)
			if (t[i] == deg2)
				e[i].push_back(node(deg0, id));
	}
	else
	{
		for (int i = 1; i <= n; i++)
			e[i].push_back(node(t[i], id));
	}
}
typedef pair<int, int> pii;
priority_queue<pii> q;
int dis[maxn][maxn];
bool vis[maxn];
void getdis(int st)
{
	for (int i = 1; i <= n; i++)
		dis[st][i] = inf, vis[i] = false;
	dis[st][st] = 0;
	while (!q.empty()) q.pop();
	q.push({0, st});
	while (!q.empty())
	{
		pii tmp = q.top();
		int x = tmp.second;
		q.pop();
		if (vis[x]) continue;
		vis[x] = true;
		for (auto edge : e[x])
		{
			int y = edge.y, val = edge.val;
			if (dis[st][y] > max(dis[st][x], val))
			{
				dis[st][y] = max(dis[st][x], val);
				q.push({-dis[st][y], y});
			}
		}
	}
} 
void getAllDis()
{
	for (int i = 1; i <= n; i++)
		getdis(i);
}
void sol()
{
	scanf("%d%d%d", &n, &l, &Q);
	for (int i = 1; i <= n; i++)
		e[i].clear();
	for (int i = 1; i <= l; i++)
	{
		scanf("%s", s);
		int len = strlen(s);
		for (int i = 0; i < len; i += 2)
			t[i / 2 + 1] = getnum(s[i], s[i + 1]); 
		check_p(i);
	}
	getAllDis();
	for (int i = 1; i <= Q; i++)
	{
		scanf("%s", s);
		int len = strlen(s);
		int a, b, c;
		a = getnum(s[0], s[1]);
		b = getnum(s[2], s[3]);
		c = getnum(s[4], s[5]);
		if (dis[a][b] <= c)
			printf("1");
		else
			printf("0");
	}
	printf("\n");
}
int main()
{
	int T;
	scanf("%d", &T);
	while (T--) sol();
	return 0;
}