# define _CRT_SECURE_NO_WARNINGS 1
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <forward_list>
# include <map>
# include <stack>
using namespace std;

# define INF ((int)(1<<25))
# define REP(i,n) for(int i=0;i<(int)n;i++)
# define FOR(i,n) REP(i,n)
# define TORAD 2.0*M_PI/360.0
# define INT(x) int x;cin>>x;
# define ALL(x) (x).begin(),(x).end()
# define RALL(x) (x).rbegin(),(x).rend()
# define DEBUG(x) cout<<#x<<" :"<<x<<endl;
# define EPS 1e-12



template<class T> void debug(T a) { for (auto i : a)cout << i << endl; }

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
int dx[4] = { 0,1,0,-1 }, dy[4] = { -1,0,1,0 };

int main()
{
	INT(n);
	int a[110][110];
	FOR(i, 110)FOR(j, 110)a[i][j] = (i != j ? INF:0);
	FOR(i, n)
	{
		INT(r);
		INT(k);
		FOR(j, k)
		{
			INT(t);
			a[r][t] = 1;
		}
	}
	FOR(k, n+1)FOR(i, n+1)FOR(j, n+1)a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
	INT(p);
	FOR(i, p)
	{
		INT(s); 
		INT(g);
		INT(t);
		if (a[s][g]+1 <= t)cout << a[s][g]+1 << endl;
		else cout << "NA" << endl;
	}

}