#include<bits/stdc++.h>

using namespace std;

//input by bxd

#define rep(i,a,b) for(int i=(a);i<=(b);i++)

#define repp(i,a,b) for(int i=(a);i>=(b);--i)

#define RI(n) scanf("%d",&(n))

#define RII(n,m) scanf("%d%d",&n,&m)

#define RIII(n,m,k) scanf("%d%d%d",&n,&m,&k)

#define RS(s) scanf("%s",s);

#define ll long long

#define pb push_back

#define REP(i,N)  for(int i=0;i<(N);i++)

#define CLR(A,v)  memset(A,v,sizeof A)

//////////////////////////////////

#define inf 0x3f3f3f3f

const int N=+;

int f[N];

int find1(int x)

{

    return f[x]==x?x:f[x]=find1(f[x]);

}

struct node

{

    int x,y,v;

}s[N];

bool cmp(node a,node b)

{

    return a.v>b.v;

}

void union1(int x,int y)

{

    int a=find1(x);

    int b=find1(y);

    if(a!=b)

        f[a]=b;

}

int vis[N];

int main()

{

    int n,m;

    RII(n,m);

    rep(i,,n)f[i]=i;

    char s[];

    int a,b;

    rep(i,,m)

    {

        RS(s);RII(a,b);

        if(s[]=='F')

            union1(a,b);

        else

        {

            if(!vis[a])vis[a]=b;

            else union1(vis[a],b);

            if(!vis[b])vis[b]=a;

            else union1(vis[b],a);

        }

    }

    int cnt=;

    rep(i,,n)

    if(f[i]==i)

        cnt++;

    cout<<cnt;

    return ;

}