#include<bits/stdc++.h>
const int maxn = 2e3 + 5;
const int maxm = 1e6 + 5;
const int maxq = 1e6 + 5;
const int inf = 1e9 + 7;
using namespace std;
int n, T, Q, l;
int t[maxn][maxn], in[maxn], fa[maxn];
char s[maxm];
int dis[maxn], vis[maxn], ans[maxq];
struct node{
    int x, tim, num;
};
vector<pair<int, int> > edge[maxn];
vector<node> st[maxn];
priority_queue<pair<int, int>> q;
void dijkstra(int v0){
    for (int i = 1; i <= n; i++)
        dis[i] = inf, vis[i] = 0;
    dis[v0] = 0;
    q.push({0, v0});
    while (!q.empty()){
        int x = q.top().second;
        q.pop();
        if(vis[x])
            continue;
        vis[x] = 1;
        for(auto v : edge[x]){
            int y = v.first, w = v.second;
            //cout << x << " " << y << " " << w << endl;
            if(dis[y] > max(dis[x], w)){
                dis[y] = max(dis[x], w);
                if(!vis[y])
                    q.push({-dis[y], y});
            }
        }
    }
}
int find(int x){
    return (x == fa[x]) ? x : fa[x] = find(fa[x]);
}
void merge(int x, int y, int num){
    int fx = find(x), fy = find(y);
    if(x == y)
        return;
    edge[x].push_back({y, num});
    edge[y].push_back({x, num});
    fa[fx] = fy;
}
void solve(){
    scanf("%d %d %d", &n, &l, &Q);
    for (int i = 1; i <= l;i++){
        scanf("%s", s + 1);
        int m = strlen(s + 1);
        for (int j = 1, k = 1; j <= m; j += 2, k++)
            t[i][k] = (s[j] - '0') * 50 + (s[j + 1] - '0');
    }
    for (int i = 1; i <= n; i++)
        fa[i] = i, edge[i].clear(), st[i].clear(), fa[i] = i;
    for (int i = 1, a, b, c; i <= Q; i++)
    {
        scanf("%s", s + 1);
        a = (s[1] - '0') * 50 + (s[2] - '0');
        b = (s[3] - '0') * 50 + (s[4] - '0');
        c = (s[5] - '0') * 50 + (s[6] - '0');
        st[a].push_back({b, c, i});
    }
    for (int i = 1; i <= l;i++){
        for (int j = 1; j <= n; j++)
            in[j] = 0;
        for (int j = 1; j <= n; j++)
            in[t[i][j]]++;
        int sz = 0;
        for (int j = 1; j <= n;j++)
            sz += (in[j] > 0);
        //cout << i << "--- " << sz << endl;
        if(sz <= n-2)
            continue;
        if(sz == n)
            for (int j = 1; j <= n;j++)
                merge(j, t[i][j], i);
        else{
            int x = 0, y = 0;
            for (int j = 1; j <= n;j++){
                if(in[j] == 0)
                    x = j;
                else if(in[j] == 2)
                    y = j;
            }
            for (int j = 1; j <= n; j++){
                if(t[i][j] == y && j != x)
                    edge[j].push_back({x, i});
            }
        }
    }
        if(Q >= 100000)
        return;
    for (int i = 1; i <= n; i++){
        dijkstra(i);
        for (auto x : st[i]){
            if(dis[x.x] <= x.tim)
                ans[x.num] = 1;
            else
                ans[x.num] = 0;
        }
        //for (int j = 1; j <= n; j++)
            //cout << dis[j] << " ";
        //cout << endl;
    }
    for (int i = 1; i <= Q; i++)
        printf("%d", ans[i]);
    puts("");
}
int main(){
    scanf("%d", &T);
    for (; T;T--)
        solve();
    return 0;
}