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

struct DSU {
    vector<int> sz, f;
    DSU(int n) {
        sz.assign(n + 1, 1);
        f.assign(n + 1, 0);
        for (int i = 1; i <= n; i++) f[i] = i;
    }

    int root(int u) {
        if (u == f[u]) return u;
        return root(f[u]);
    }

    void merge(int u, int v) {
        u = root(u), v = root(v);
        if (u == v) return;
        if (sz[u] > sz[v]) swap(u, v);
        sz[v] += sz[u];
        f[u] = v;
    }

    int size(int u) {
        return sz[root(u)];
    }

    bool same(int u, int v) {
        return root(u) == root(v);
    }
};

void solve() {
    int m;
    cin >> m;

    vector<array<int, 3>> opt;
    vector<int> b;
    for (int i = 0; i < m; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        b.push_back(x);
        b.push_back(y);
        opt.push_back({x, y, z});
    }

    sort(b.begin(), b.end()); b.erase(unique(b.begin(), b.end()), b.end());

    for (auto &[x, y, z] : opt) {
        x = lower_bound(b.begin(), b.end(), x) - b.begin();
        y = lower_bound(b.begin(), b.end(), y) - b.begin();
    }

    int n = b.size();
    DSU dsu(n);

    for (auto [x, y, z] : opt) {
        if (z == 1) dsu.merge(x, y);
    }

    for (auto [x, y, z] : opt) {
        if (z == 0) {
            if (dsu.same(x, y)) {
                cout << "NO\n"; return;
            }
        }
    }
    cout << "YES\n";
}
signed main() {
    int t = 1;
    cin >> t;
    while (t--) solve();
}
/*
g++ -std=c++20 1.cpp -o 1 && 1 < in.txt > out.txt
*/