#include <iostream>
#include <algorithm>
#include <map>

void one() {
    int n;
    std::cin >> n;

    std::map<int, int> from, to;
    for (int i = 0; i < n; ++i) {
        int l, a, b;
        std::cin >> l >> a >> b;
        from[a] += l;
        to[b] += l;
    }

    int diff = 0;
    auto p = from.begin();
    auto q = to.begin();
    for (;;) {
        if (p->second < q->second) {
            diff -= p->first * p->second;
            diff += q->first * p->second;

            q->second -= p->second;
            ++p;
        } else if (p->second == q->second) {
            diff -= p->first * p->second;
            diff += q->first * q->second;
            
            ++p;
            ++q;
        } else {
            diff -= p->first * q->second;
            diff += q->first * q->second;

            p->second -= q->second;
            ++q;
        }

        if (diff < 0 || p == from.end()) {
            break;
        }
    }

    std::cout << (diff == 0 ? "TAK" : "NIE") << "\n";
}

int main() {
    int t;
    std::cin >> t;
    
    for (int i = 0; i < t; ++i) {
        one();
    }
}