#include<bits/stdc++.h>
using namespace std;
constexpr int maxn=1e6+5;
int dfn[maxn],low[maxn],tim,top,stk[maxn],n,m,col[maxn];
vector<pair<int,int>> e[maxn];vector<vector<int> >cc;
bool vis[maxn];
#define pb push_back
void dfs(int p,int f){
    int cnt=0;dfn[p]=low[p]=++tim;stk[++top]=p;
    for(auto [x,cinema]:e[p]){
        if(x==f) continue;
        if(dfn[x]) low[p]=min(low[p],dfn[x]);
        else{
            dfs(x,p);
            low[p]=min(low[p],low[x]);
            if(low[x]>=dfn[p]){
                vector<int> tmp;
                while(stk[top+1]!=x) tmp.pb(stk[top--]);
                tmp.pb(p);cc.pb(tmp);
            }
            cnt++;
        }
    }
    if(!cnt&&!f){
        vector<int> tmp;tmp.pb(p);
        cc.pb(tmp);
    }
}
inline void solve(){
    cin>>n>>m;tim=0;cc.clear();
    for(int i=1;i<=n;i++) e[i].clear(),dfn[i]=low[i]=0;
    for(int i=1,u,v;i<=m;i++) cin>>u>>v>>col[i],e[u].emplace_back(v,i),e[v].emplace_back(u,i);
    for(int i=1;i<=n;i++) if(!dfn[i]) dfs(i,0);
    for(auto x:cc){
        int msk=0,cnt=0;
        for(auto y:x) vis[y]=1;
        for(auto y:x){
            int w=0;
            for(auto [z,id]:e[y])if(vis[z]) w|=1<<col[id]-1;
            msk|=w,cnt+=(__builtin_popcount(w)>1);
        }
        for(auto y:x) vis[y]=0;
        if(msk==7&&cnt>=3) return puts("Yes"),void();
    }
    puts("No");
}
int main(){
    std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t;cin>>t;
    while(t--) solve();
}