#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
#define sz 202020
typedef long long ll;

int n,m;
vector<pii>V[sz];

int dfn[sz],low[sz],cc;
stack<int>S;
int T;
vector<int>V2[sz<<1];
void dfs(int x,int fa) {
    dfn[x]=low[x]=++cc; S.push(x);
    for (auto [v,c]:V[x]) if (v!=fa) {
        if (!dfn[v]) dfs(v,x),chkmin(low[x],low[v]);
        else chkmin(low[x],dfn[v]);
    }
    if (fa&&low[x]>=dfn[fa]) {
        int y; ++T;
        do {
            y=S.top(); S.pop();
            V2[T].push_back(y),V2[y].push_back(T);
        } while (y!=x);
        V2[T].push_back(fa),V2[fa].push_back(T);
    }
}
int fa[sz<<1],dep[sz<<1];
void dfs2(int x,int ff) {
    fa[x]=ff,dep[x]=dep[ff]+1;
    for (auto v:V2[x]) if (v!=ff) dfs2(v,x);
}

// namespace DSU {
//     int fa[sz];
//     int getfa(int x){return x==fa[x]?x:getfa(fa[x]);}
//     void merge(int x,int y){fa[getfa(x)]=getfa(y);}
//     void init(unordered_set<int>vert) {for (auto x:vert) fa[x]=x;}
// }

int check(vector<array<int,3>>E) {
    unordered_map<int,int>mask; int M=0;
    unordered_set<int>vert;
    for (auto [x,y,z]:E) mask[x]|=1<<z,mask[y]|=1<<z,M|=1<<z,vert.insert(x),vert.insert(y);
    if (M!=7) return 0;
    int cc=0,X=-1,Y=-1;
    for (auto [x,m]:mask) if (m==7) {
        ++cc;
        if (X==-1) X=x;
        else Y=X,X=x;
    }
    if (cc!=2) return 1;
    for (auto x:vert) if (x!=X&&x!=Y&&__builtin_popcount(mask[x])!=1) return 1;
    // rep(t,0,2) {
    //     DSU::init(vert);
    //     for (auto [x,y,z]:E) if (z==t) DSU::merge(x,y);
    //     for (auto x:vert) if (x!=X&&x!=Y&&DSU::getfa(x)==DSU::getfa(X)&&mask[x]!=(1<<t)) return 1; 
    // }
    return 0;
}

vector<array<int,3>>E[sz<<1];

void clr() {
    rep(i,1,n) V[i].clear(),dfn[i]=low[i]=cc=0;
    rep(i,1,T) V2[i].clear(),E[i].clear(),fa[i]=dep[i]=0;
    T=0;
}


void work() {
    cin>>n>>m;
    int x,y,z;
    rep(i,1,m) cin>>x>>y>>z,--z,V[x].push_back({y,z}),V[y].push_back({x,z});
    T=n;
    dfs(1,0);
    dfs2(1,0);
    rep(x,1,n) for (auto [y,z]:V[x]) if (x<y) {
        int _x=x,_y=y,ww=-1;
        if (dep[_x]<dep[_y]) swap(_x,_y);
        ww=fa[_x];
        E[ww-n].push_back({x,y,z});
    }
    rep(i,1,T-n) if (check(E[i])) return clr(),cout<<"Yes\n",void();
    cout<<"No\n",clr();
}

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    int T; cin>>T;
    while (T--) work();
    return 0;
}