//入力確認用
#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;

template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}
template<class T> ostream& operator >> (ostream& os, const T& val){ return os << " " << val;}


class UnionFindTree{
	struct base_node{
		int parent;
		int rank;
		int size;
	};
	
	vector<base_node> node;
public:
	UnionFindTree(int n){
		node.resize(n);
		for(int i=0; i<n; i++){
			node[i].parent=i;
			node[i].rank=0;
			node[i].size=1;
		}
	}

	int find(int x){  //return root node of x
		if(node[x].parent == x) return x;
		else{
			return node[x].parent = find(node[x].parent);
		}
	}
	
	bool same(int x, int y){
		return find(x) == find(y);
	}

	int size(int at){
		return node[find(at)].size;
	}

	void unite(int x, int y){
		x = find(node[x].parent);
		y = find(node[y].parent);

		if(x==y) return;

		if(node[x].rank < node[y].rank){
			node[x].parent = y;
			node[y].size += node[x].size;
		}else if(node[x].rank > node[y].rank){
			node[y].parent = x;
			node[x].size += node[y].size;
		}else{
			node[x].rank++;
			unite(x,y);
		}
	}
};


int main_(){
	int n;
	cin >> n;
	assert(2<=n && n<=100000);
	vector<int> a(n);
	for(int i=0; i<n; i++){
		//scanf("%d", &a[i]);
		cin >> a[i];
		assert(1<=a[i] && a[i]<=100000);
	}
	UnionFindTree uft(n);
	for(int i=0; i<n-1; i++){
		int u,v;
		cin >> u,v;
		//scanf("%d%d", &u,&v);
		assert(1<=u && u<=n);
		assert(1<=v && v<=n);
		assert(u!=v);
		u--,v--;
		uft.unite(u,v);
	}

	int q;
	cin >> q;
	assert(1<=q && q<=100000);
	while(q--){
		int u,v;
		cin >> u,v;
		//scanf("%d%d", &u,&v);
		assert(1<=u && u<=n);
		assert(1<=v && v<=n);
		assert(u!=v);
		cout << "UNKO" << endl;
	}
	return 0;
}

int main(){
	//auto s = clock();
	main_();
	//cerr << clock()-s << " [ms] " << endl;
	return 0;
}