#pragma GCC optimize("O3", "unroll-loops") // "Ofast"
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
#include <bits/stdc++.h>
//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvt = vt< vt<ll> >;
const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e9 + 7, LIM = (1ll << 60);
const double eps = 1e-6;
int n, m, p[N], r[N], cnt[N], kol;
map<pii, bool> used;
int getp (int v) {
return (p[v] == v ? v : p[v] = getp(p[v]));
}
void unite (int a, int b) {
a = getp(a);
b = getp(b);
if (a == b) return;
if (r[a] > r[b]) swap(a, b);
p[a] = b;
r[b] += r[a];
r[a] = 0;
}
vt<pii> v;
void solve () {
cin >> n >> m;
for (int i = 1; i <= n; i++) p[i] = i, r[i] = 1;
for (int i = 1; i <= m; i++) {
int x, y;
char c;
cin >> x >> y >> c;
if (c == 'A') v.pb({x, y});
else unite(x, y);
}
for (int i = 1; i <= n; i++) if (r[i] != 0) kol++;
for (auto [x, y]: v) {
x = getp(x), y = getp(y);
if (x == y || used[{x, y}] || used[{y, x}]) continue;
cnt[x]++, cnt[y]++;
used[{x, y}] = used[{y, x}] = 1;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (cnt[i] == kol - 1) ans += r[i];
}
cout << ans;
cout << '\n';
}
bool testcases = 0;
signed main() {
cin.tie(0) -> sync_with_stdio(0);
int test = 1;
if (testcases) cin >> test;
for (int cs = 1; cs <= test; cs++) {
solve();
}
}
