import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;

void main(){
    auto n = readInt();
    auto m = new long[][](n, n);
    const long inf = long.max/n;
    foreach(i; iota(n)) {
        foreach(j; iota(n)) {
            m[i][j] = inf;
        }
        m[i][i] = 0;
    }
    foreach(i; iota(n)) {
        auto l = readInts();
        auto r = l[0];
        auto k = l[1];
        auto t = l[2..$];
        foreach(j; iota(k)) {
            m[r-1][t[j]-1] = 1;
        }
    }
    foreach(i; iota(n)) {
        foreach(j; iota(n)) {
            foreach(k; iota(n)) {
                m[j][k] = min(m[j][k], m[j][i] + m[i][k]);
            }
        }
    }
    auto p = readLong();
    foreach(i; iota(p)) {
        int s, d, v;
        readlnTo(s, d, v);
        auto u = m[s-1][d-1] + 1;
        writeln(u <= v ? u.to!string: "NA");
    }
}