#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int c, t, n, m, x, y, ok;
vector<pair<int, int>> G[N];
int eq[N], flip[N], col[N], vis[N];
inline int dfs(int x) {
    vis[x] = 1;
    int siz = 1;

    for (auto &edge : G[x]) {
        const int y = edge.first;
        const int w = edge.second;

        if (vis[y]) {
            ok &= (col[y] == (col[x] ^ w));
        } else {
            col[y] = col[x] ^ w, siz += dfs(y);
        }
    }

    return siz;
}
inline void solve(void) {
    char opt;
    cin >> n >> m, n++;

    for (int i = 0; i <= n; i++) {
        G[i].clear(), eq[i] = i;
        flip[i] = col[i] = vis[i] = 0;
    }

    for (int i = 1; i <= m; i++) {
        cin >> opt >> x;

        if (opt == 'T')
            eq[x] = n, flip[x] = 0;
        else if (opt == 'F')
            eq[x] = n, flip[x] = 1;
        else if (opt == 'U')
            eq[x] = 0, flip[x] = 0;
        else
            cin >> y, eq[x] = eq[y], flip[x] = (opt == '-') ^ flip[y];
    }

    for (int i = 0; i <= n; i++) {
        G[i].push_back({eq[i], flip[i]});
        G[eq[i]].push_back({i, flip[i]});
    }

    int ans = dfs(0);

    for (int i = 1, siz; i <= n; i++) {
        if (vis[i])
            continue;

        ok = 1, siz = dfs(i);

        if (!ok)
            ans += siz;
    }

    cout << ans - 1 << '\n';
}
inline void optimizeIO(void) {
    ios::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
}
int main(int argc, char const *argv[]) {
    optimizeIO(), cin >> c >> t;

    while (t--)
        solve();

    return 0;
}