#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int t, n, m;
vector <pii> gan[1100000];
int sum[4][1100000];
int vis[1100000];
int cnt;
bool dfs(int now, int prev, int dep){
    if(vis[now]){
        bool ret = true;
        for(int k=1;k<=3;k++)
            ret &= (sum[k][dep]-sum[k][vis[now]])>0;
        return ret;
    }
    vis[now] = dep;
    for(int k=1;k<=3;k++)
        sum[k][dep+1] = sum[k][dep];
    for(pii nex: gan[now])if(prev != nex.first){    
        sum[nex.second][dep+1]++;
        if(dfs(nex.first, now, dep+1))
            return true;
        sum[nex.second][dep+1]--;
    }
    return false;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> t;
    while(t--){
        cin >> n >> m;
        cnt = 0;
        for(int i=0;i<=n;i++){
            vis[i]= 0;
            sum[1][i]=sum[2][i]=sum[3][i]=0;
            gan[i].clear();
        }
        
        for(int i=0;i<m;i++){
            int x, y, z;
            cin >> x >> y >> z;
            gan[x].push_back({y, z});
            gan[y].push_back({x, z});
        }

        if(dfs(1, 1, 0))
            cout << "Yes\n";
        else
            cout << "No\n";
    }

}