#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];
vector<int> bcc[MAX_N];
vector<int> st;
int low[MAX_N], dfn[MAX_N];
int piv = 0, c = 0;
pii edge[MAX_N];
int col[MAX_N];

void dfs(int x, int p){
    dfn[x] = low[x] = ++piv;
    for (auto[y, id]: adj[x]) {
        if (!dfn[y]) {
            st.push_back(id);
            dfs(y, x);
            low[x] = min(low[x], low[y]);
            if (low[y] >= dfn[x]) {
                ++c;
                while (!st.empty()) {
                    int tmp = st.back();
                    bcc[c].push_back(tmp);
                    st.pop_back();
                    if (tmp == id) break;
                }
            }
        } else if (y != p) {
            low[x] = min(low[x], dfn[y]);
            if (dfn[x] > dfn[y]) st.push_back(id);
        }
    }
}

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

    for (int i=0; i<m; ++i) {
        int a, b;
        cin >> a >> b >> col[i];
        adj[a].push_back({ b, i });
        adj[b].push_back({ a, i });
        edge[i] = {a, b};
    }
    
    dfs(1, -1);
    vector<int> ok(n+1, 0);
    for (int i=1; i<=c; ++i) {
        int edge_ok = 0;
        vector<int> ver;
        for (int id: bcc[i]) {
            auto[u, v] = edge[id];
            int j = col[id];
            edge_ok |= (1 << j);
            
            if (!ok[u]) ver.push_back(u);
            ok[u] |= (1 << j);
            if (!ok[v]) ver.push_back(v);
            ok[v] |= (1 << j);
        }
        
        int cnt = 0;
        for (int u: ver) cnt += (__builtin_popcount(ok[u]) >= 2);
        for (int u: ver) ok[u] = 0;
        if (edge_ok == 14 && cnt >= 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();
}