#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define endl '\n'
//data structures
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<long long, long long> pll;
typedef pair<char, int> ci;
typedef pair<string, int> si;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vvi;
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define sz(a) ((int)a.size())
#define fi first
#define se second
#define whole(v) v.begin(), v.end()
#define rwhole(v) v.rbegin(), v.rend()
#define fro front
#define pqueue priority_queue
#define ubound upper_bound
#define lbound lower_bound
#define beg(v) v.begin()
//bit operations
int flip(int x){
return ~(x) ^ (1 << 32);
}
int allon(int x){
return (1LL << x) - 1;
}
bool bit(ll a, ll i){
return (1LL << i) & a;
}
#define llpc(x) __builtin_popcountll(x)
#define ipc(x) __builtin_popcount(x)
#define iclz(x) __builtin_clz(x)
#define llclz(x) __builtin_clzll(x)
#define ictz(x) __builtin_ctz(x)
#define llctz(x) __builtin_ctzll(x)
//answers
#define cYES cout << "YES" << endl
#define cYes cout << "Yes" << endl
#define cyes cout << "yes" << endl
#define cNO cout << "NO" << endl
#define cNo cout << "No" << endl
#define cno cout << "no" << endl
#define ipsb cout << -1 << endl
const ll mod2 = 998244353;
const ll mod = 1000000007;
const int inf = int(1e9); // ll inf = ll(1e18);
// read arr vec matr etc
#define fill(x, y) memset(x, y, sizeof(x))
void read(vector<int> &x){
for(auto &e:x) cin >> e;
}
void sread(vector<string> &x){
for(auto &e:x) cin >> e;
}
void mread(vector<vector<int>> &p, int nnn, int mmm){
for(int i = 0; i < nnn; ++i){
vector<int> pp;
for(int j = 0; j < mmm; ++j){
int wq; cin >> wq; pp.pb(wq);
}
p.pb(pp);
}
}
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //high quality random number generator using time as seed
//int random(int l, int r){return uniform_int_distribution<int>(l,r)(rng);} //returns a randomb number between [l, r]
// Solution
int fat[500005];
int len[500005];
int ffather(int no){
if(fat[no] == no) return no;
return fat[no] = ffather(fat[no]);
}
void join(int u, int v){
u = ffather(u);
v = ffather(v);
if(u == v)return;
if(len[u] < len[v])swap(u, v);
fat[v] = u;
len[u] += len[v];
}
void tc(){
int n, m; cin >> n >> m;
for(int i = 0; i <= n; ++i){
fat[i] = i;
len[i] = 1;
}
vector<ii> bus;
for(int i = 0; i < m; ++i){
int u, v;
char ch; cin >> u >> v >> ch;
if(ch == 'T'){
join(u, v);
}else{
bus.pb({u, v});
}
}
int comps = 0;
for(int i = 1; i <= n; ++i){
if(fat[i] == i){
comps++;
}
}
int need[n+1];
for(int i = 0; i <= n; ++i){
need[i]= comps-1;
}
map<ii, int> joint;
for(auto e:bus){
int u = e.first;
int v = e.second;
u = ffather(u);
v = ffather(v);
if(u == v)continue;
if(joint[{u, v}] == 1)continue;
joint[{u, v}] = 1;
need[u]--;
need[v]--;
}
int ans = 0;
for(int i = 1; i <= n; ++i){
if(fat[i] == i && need[i] == 0){
ans += len[i];
}
}
cout << ans << endl;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1;
//cin >> t;
while(t--){
tc();
}
}
