#include <iostream>
#include <map>
#include <queue>
using namespace std;
#define LL long long
int main()
{
    LL t;
    cin >> t;
    for (int x = 0; x < t; ++x)
    {
        LL n;
        cin >> n;
        map<LL, queue<LL>> equal;
        queue<LL> inquiry_a, inquiry_b;
        map<LL, LL> value;
        for (int i = 0; i < n; ++i)
        {
            LL a, b, c;
            cin >> a >> b >> c;
            if (1 == c) // equal
            {
                map<LL, queue<LL>> :: iterator it = equal.find(a);
                if (it == equal.end())
                {
                    queue<LL> q;
                    q.push(b);
                    equal.insert({a, q});
                }
                else
                {
                    equal[a].push(b);
                }
                it = equal.find(b);
                if (it == equal.end())
                {
                    queue<LL> q;
                    q.push(a);
                    equal.insert({b, q});
                }
                else
                {
                    equal[a].push(a);
                }
            }
            else // inquiry
            {
                inquiry_a.push(a);
                inquiry_b.push(b);
            }
        }
        LL index = 0ll;
        for (auto const& [first, second] : equal)
        {
            map<LL, LL> :: iterator it = value.find(first);
            if (it == value.end())
            {
                index ++;
                queue<LL> q;
                q.push(first);
                while (!q.empty())
                {
                    LL a = q.front();
                    q.pop();
                    value.insert({a, index});
                    map<LL, queue<LL>> :: iterator it2 = equal.find(a);
                    if (it2 != equal.end())
                    {
                        while (!it2->second.empty())
                        {
                            LL b = it2->second.front();
                            it2->second.pop();
                            if (value.find(b) == value.end())
                            {
                                q.push(b);
                            }
                        }
                    }
                }
            }
        }
        /*for (auto const& [first, second] : value)
        {
            cout << first << " " << second << endl;
        }*/
        bool result = true;
        while (!inquiry_a.empty())
        {
            LL a = inquiry_a.front();
            inquiry_a.pop();
            LL b = inquiry_b.front();
            inquiry_b.pop();
            if (a == b)
            {
                result = false;
                continue;
            }
            if (value.find(a) == value.end() || value.find(b) == value.end())
            {
                continue;
            }
            else
            {
                if (value[a] == value[b]) result = false;
            }
        }
        if (result)
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
    return 0;
}