#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define f first
#define s second
using namespace std;
using ll = long long;
using pii = pair <int, int>;
const int N = 2e5 + 5;
int n, q, p[N];
int get(int v) {
    if (p[v] == v)
        return v;
    return p[v] = get(p[v]);
}
bool uni(int u, int v) {
    u = get(u), v = get(v);
    if (u == v)
        return 0;
    p[u] = v;
    return 1;
}
void solve() {
    cin >> n >> q;
    vector <pair <int, pii> > ed;
    vector <int> weights;
    for (int i = 1; i <= q; ++i)
        weights.pb(i);
    for (int _ = 0; _ < q; ++_) {
        int tp;
        cin >> tp;
        if (tp == 1) {
            int u, v, w;
            cin >> u >> v >> w;
            ed.pb({w, {u, v}});
            sort(all(ed));
        } else {
            int k, w;
            cin >> k >> w;
            
            bool fnd = 0;
            for (int mask = 0; mask < (1 << sz(ed)); ++mask) {
                if (__builtin_popcount(mask) != n - 1)
                    continue;
                vector <int> vec;
                bool ok = 1;
                for (int i = 1; i <= n; ++i)
                    p[i] = i;
                for (int i = 0; i < sz(ed); ++i) {
                    if ((mask >> i) & 1) {
                        vec.pb(ed[i].f);
                        if (!uni(ed[i].s.f, ed[i].s.s))
                            ok = 0;
                    }
                }
                sort(all(vec));
                ok &= (vec[k - 1] == w);
                if (ok) {
                    fnd = 1;
                    break;
                }
            }
            
            cout << (fnd ? "YES\n" : "NO\n");
        }
    }
}
int main() {
    ios :: sync_with_stdio(false);
    cin.tie(nullptr);
    srand(time(0));
    int TT;
    cin >> TT;
    while (TT--)
        solve();
    return 0;
}