#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <ctime>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)

#define delete(a,n) a.erase(remove(all(a),n),a.end())
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false;  for(int i=2;i*i<=n;i++)if(n%i==0)return false;  return true;} 
ll b_pow(ll x,ll n){return n ? b_pow(x*x,n/2)*(n%2?x:1) : 1ll;}
string itos(int n){stringstream ss;ss << n;return ss.str();}


int id[1010]={};
int from[1010]={};
int x[1010];
int y[1010];
int prev[1010];
int done[1010];

struct NODE{
	int to;
	double cost;
	int prev;
	NODE(int to,double cost,int prev) : to(to) ,cost(cost) , prev(prev) {}
};
bool operator < (const NODE &a,const NODE &b){
	return a.cost > b.cost;
}
int main(){
	ios_base::sync_with_stdio(false);
	int n;
	while(cin >> n && n){
		for(int i = 0 ; i < n ; i++){
			cin >> id[i] >> x[i] >> y[i];
			from[id[i]] = i;
		}
		int m;
		cin >> m;
		for(int xx = 0 ; xx < m ; xx++){
			int s,g;
			cin >> s >> g;
			s = from[s];
			g = from[g];
			priority_queue<NODE> Q;
			Q.push(NODE(s,0,-1));
			memset(done,0,sizeof(done));
			while(Q.size()){
				NODE q = Q.top(); Q.pop();
				if( done[q.to]++ ) continue;
				else prev[q.to] = q.prev;
				if( q.to == g ){
					vector<int> r;
					r.push_back(q.to);
					q.to = prev[q.to];
					while(q.to != -1 ){
						r.push_back(q.to);
						q.to = prev[q.to];
					}
					for(int i = r.size() -1 ; i >= 0 ; i--)
						cout << id[r[i]] << (i?" ":"\n");
					goto exit;
				}
				for(int i = 0 ; i < n ; i++){
					if( (x[q.to]-x[i])*(x[q.to]-x[i])+(y[q.to]-y[i])*(y[q.to]-y[i]) > 2500 ) continue;
					Q.push(NODE(i,q.cost+sqrt((x[q.to]-x[i])*(x[q.to]-x[i])+(y[q.to]-y[i])*(y[q.to]-y[i])),q.to));
				}
			}
			cout << "NA" << endl;
			exit:;
			
		}
	}
}