#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define per(i,r,l) for(int i=r; i>=l; i--)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

const int N = 2000010;
vector<P> e[N];
int vis[N], dfn[N], low[N], tim, sta[N], top, scc, bel[N], col[N][4], tmp[N], cnt[N];

void tarjan(int u, int father) {
    vis[u] = 1, dfn[u] = low[u] = ++tim, sta[++top] = u;
    for (auto [v, w]: e[u]) {
        if (v == father) continue;
        if (!dfn[v]) {
            tarjan(v, u);
            if (low[v] >= dfn[u]) {
                scc++;
                int now = -1;
                do {
                    now = sta[top--];
                    bel[now] = scc;
                } while (now != v);
            }
            low[u] = min(low[u], low[v]);
        }
        else if (vis[v]) low[u] = min(low[u], dfn[v]);
    }
}

int main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n, m; scanf("%d%d", &n, &m);
        rep (i, 1, m) {
            int u, v, w;
            scanf("%d%d%d", &u, &v, &w);
            e[u].push_back(P(v, w));
            e[v].push_back(P(u, w));
        }
        rep (i, 1, n) if (!dfn[i]) {
            tarjan(i, 0);
        }
        top = 0;
        int flag = 0;
        rep (u, 1, n) {
            for (auto [v, w]: e[u]) {
                int ksj = dfn[u] > dfn[v]? bel[u]: bel[v];
                sta[++top] = ksj;
                col[ksj][w] = 1;
                if (tmp[ksj]) {
                    if (w != tmp[ksj]) tmp[ksj] = 4;
                } else {
                    tmp[ksj] = w;
                }
            }
            while (top) {
                int v = sta[top--];
                if (tmp[v] == 4) cnt[v]++;
                tmp[v] = 0;
                if (col[v][1] && col[v][2] && col[v][3] && cnt[v] >= 3) {
                    flag = 1;
                    break;
                }
            }
            if (flag) break;
        }
        // int flag = 0;
        // rep (i, 1, scc) {
        //     if (col[i][1] && col[i][2] && col[i][3] && cnt[i] >= 3) {
        //         flag = 1;
        //         break;
        //     }
        // }
        if (flag) puts("Yes");
        else puts("No");
        rep (i, 1, n) dfn[i] = low[i] = vis[i] = cnt[i] = col[i][2] = col[i][1] = col[i][3] = 0;
        scc = tim = top =0;
        rep (i, 1, n) e[i].clear();
    }

    return 0;
}