#include <bits/stdc++.h>
using namespace std;


const int N = 2005;
typedef pair<int,int> pii;
vector<int>p(N);

int find(int v){
    return (p[v]==v) ? v : p[v] = find(p[v]);
}


void solve(){
    iota(p.begin(), p.end(), 0);
    int n, l, q;
    cin >> n >> l >> q;

    vector<pii>adj[n+1];
    vector<int>nxt(n+1), in(n+1);
    for(int t=1; t<=l; t++){
        string s;
        cin >> s;
        fill(in.begin(), in.end(), 0);
        for(int j=0; j<s.length(); j+=2){
            nxt[j/2+1] = (s[j]-'0')*50+(s[j+1]-'0');
            in[nxt[j/2+1]]++;
        }
        int sz = 0;
        for(int j=1; j<=n; j++)if(in[j])sz++;
        if(sz <= n-2)continue;
        if(sz == n){ // cycle
            for(int i=1; i<=n; i++){
                int x = find(i), y = find(nxt[i]);
                if(x != y){
                    p[x] = y;
                    adj[i].push_back({nxt[i],t});
                    adj[nxt[i]].push_back({i,t});
                }
            }
        }
        if(sz == n-1){ 
            int mc2 = -1, mc0 = -1;
            for(int i=1; i<=n; i++){
                if(in[i]==2)mc2 = i;
                if(in[i]==0)mc0 = i;
            }
            if(mc2 == -1 || mc0 == -1)continue;
            for(int i=1; i<=n; i++){
                if(nxt[i] == mc2)adj[i].push_back({mc0,t});
            }
        }
    }

    int d[n+1][n+1];
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if(i==j)d[i][j] = 0;
            else d[i][j] = 1e9;
        }
    }

    for(int i=1; i<=n; i++){
        priority_queue<pii, vector<pii>, greater<pii>>pq;
        pq.push({0,i});
        vector<bool>vis(n+1,0);
        while(!pq.empty()){
            auto [dis,u] = pq.top();
            pq.pop();
            if(vis[u])continue;
            vis[u] = 1;
            for(auto [v,w] : adj[u]){
                if(d[i][v] > max(dis, w)){
                    d[i][v] = max(dis, w);
                    pq.push({d[i][v],v});
                }
            }
        }
    }

    while(q--){
        string s;
        cin >> s;
        int a = (s[0]-'0')*50+(s[1]-'0'), b = (s[2]-'0')*50+(s[3]-'0'), c = (s[4]-'0')*50+(s[5]-'0');
        if(d[a][b] <= c)cout << 1;
        else cout << 0;
    }
    cout << "\n";
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--)solve();
}