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

#define all(v) v.begin(), v.end()

void solve() {
    int N;
    cin >> N;
    vector<bool> ugly(N + 1), uglyNeighbor(N + 1);

    for (int i = 1; i <= N; i++) {
        int A;
        cin >> A;
        ugly[i] = A == -1;
    }

    bool running = true;
    for (int i = 1; i < N; i++) {
        int U, V;
        cin >> U >> V;

        if (running) {
            running = 0;
            if (ugly[U] && ugly[V]) {
                cout << "NEM\n2\n" << U << " " << V << "\n";
            }
            else if (uglyNeighbor[U] && ugly[V]) {
                cout << "NEM\n3\n" << uglyNeighbor[U] << " " << U << " " << V << "\n";
            }
            else if (ugly[U] && uglyNeighbor[V]) {
                cout << "NEM\n3\n" << uglyNeighbor[V] << " " << V << " " << U << "\n";
            }
            else running = 1;
        }
        
        if (ugly[U]) {
            uglyNeighbor[V] = U;
        }
        if (ugly[V]) {
            uglyNeighbor[U] = V;
        }
    }

    if (running) cout << "IGEN\n";
}

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