#include <bits/stdc++.h>
#ifdef SHARAELONG
#include "../../cpp-header/debug.hpp"
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAX_N = 5e5 + 1;

vector<pii> adj[MAX_N];
int bcc[MAX_N];
vector<int> st;
int low[MAX_N], dfn[MAX_N];
int piv = 0, c = 0;

void dfs(int x, int p){
    if (adj[x].empty()) {
        bcc[x] = ++c;
        return;
    }
    
    dfn[x] = low[x] = ++piv;
    st.push_back(x);
    for (auto[v, _]: adj[x]) {
        if (!dfn[v]) {
            dfs(v, x);
            low[x] = min(low[x], low[v]);
        } else if (v != p) {
            low[x] = min(low[x], dfn[v]);
        }
    }
    if (low[x] == dfn[x]) {
        c++;
        int e;
        do {
            e = st.back();
            st.pop_back();
            bcc[e] = c;
        } while (e != x);
    }
}

void solve() {
    int n, m;
    cin >> n >> m;
    st.clear();
    for (int i=0; i<=n; ++i) {
        adj[i].clear();
        bcc[i] = low[i] = dfn[i] = 0;
    }
    piv = 0; c = 0;

    for (int i=0; i<m; ++i) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a].push_back({ b, c });
        adj[b].push_back({ a, c });
    }
    
    dfs(1, -1);
    vector<pii> ok(c+1);
    for (int i=1; i<=n; ++i) {
        int b = bcc[i];
        int tmp = 0;
        for (auto[j, k]: adj[i]) {
            if (bcc[j] == b) {
                ok[b].first |= (1 << k);
                tmp |= (1 << k);
            }
        }
        if (__builtin_popcount(tmp) >= 2) ok[b].second++;
    }
    for (int i=1; i<=c; ++i) {
        if (ok[i].first / 2 == 7 && ok[i].second >= 3) {
            cout << "Yes\n";
            return;
        }
    }
    cout << "No\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int cases;
    cin >> cases;
    while (cases--) solve();
}