#include <bits/stdc++.h>
using namespace std;
int t, m, n, a[100005], b[100005], c[200005], f[200005], pre[200005];
bool o[100005];
int find(int x)
{
    if (x == f[x]) return x;
    int fx = find(f[x]);
    pre[x] = pre[x] ^ pre[f[x]];
    return f[x] = fx;
}
int main()
{
    cin >> t;
    while (t--)
    {
    bool flag = 1;
    memset(pre, 0, sizeof(pre));
    memset(f, 0, sizeof(f));
    cin >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> a[i] >> b[i] >> o[i];
        c[i*2-1] = a[i];
        c[i*2] = b[i];
    }
    sort(c+1, c+2*m+1);
    n = unique(c+1, c+2*m+1) - c - 1;
    for (int i = 1; i <= 2*m; i++)
        f[i] = i;
    for (int i = 1; i <= m; i++)
    {
        a[i] = lower_bound(c+1, c+n+1, a[i]) - c;
        b[i] = lower_bound(c+1, c+n+1, b[i]) - c;
        int fa = find(a[i]), fb = find(b[i]);
        if (o[i] == 1)
        {
            if (fa == fb)
            {
                if (pre[a[i]] != pre[b[i]])
                    flag=0;
            }
            else
            {
                f[fa] = fb;
                pre[fa] = pre[a[i]] ^ pre[b[i]];
            }
        }
        else
        {
            if (fa == fb)
            {
                if (pre[a[i]] == pre[b[i]])
                    flag = 0;
            }
            else
            {
                f[fa] = fb;
                pre[fa] = 1 ^ pre[a[i]] ^ pre[b[i]];
            }
        }
    }
    if (flag)
        cout << "YES";
    else
        cout << "NO";
    cout << endl;
    }
}