// Duet of Dusk Embers--XrkArul
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ULL __int128_t
#define ull unsigned long long
#define vi vector<int>
#define vll vector<ll>
#define endl '\n'
#define ednl '\n'
#define pb push_back
#define fi first
#define se second
#define ls (p<<1)
#define rs (p<<1|1)
#define fix setprecision
#define all(v) (v).begin(),(v).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define debug(x) cerr<<#x<<':'<<' '<<x<<'\n'
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define pq priority_queue<int, vector<int>>
#define PQ priority_queue<int, vector<int>, greater<int>>
const ll inf = 1e18;
const ll mod=1e9+7;
const ull hashbase = 5767169;
ll powmod(ll a,ll b){ll s=1;a%=mod;while(b){if(b&1)s=s*a%mod;b>>=1;a=a*a%mod;}return s%mod;}

#define int long long
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m;
    // cin>>n>>m;
    while(cin>>n>>m){
        // cin>>n>>m;
        string s;cin>>s;
        vector<int> d(n+1);
        rep(i,0,s.size()-1)d[i+1]=s[i]-'a';
        vector<vi> e(n+1);
        while(m--){
            int a,b;cin>>a>>b;
            // if(a>n||b>n)continue;
            if(d[a]!=d[b]){
                e[a].pb(b);
                e[b].pb(a);
            }
        }
        int ans=0;vector<vi> cnt(n+1,vi(5));vi vis(n+1);
        function<void(int)> dfs1=[&](int x){ 
            vis[x]=1;
            for(auto v:e[x]){
                if(d[x]!='b'-'a')// o
                {
                    cnt[x][2]+=(int)e[v].size()-1;
                }
                if(vis[v])continue;
                dfs1(v);
            }
        };
        rep(i,1,n)if(!vis[i])
        dfs1(1);fill(all(vis),0);
        function<void(int)> dfs=[&](int x){ 
            vis[x]=1;
            for(auto v:e[x]){
                if(d[x]=='b'-'a')// b
                {
                    cnt[x][1]+=cnt[v][2]-((int)e[x].size()-1);
                }
                if(vis[v])continue;
                dfs(v);
            }
        };
        rep(i,1,n){
            if(!vis[i])dfs(i);
        }
        // dfs(1);
        rep(i,1,n){
            if(d[i]=='b'-'a')ans+=cnt[i][1];
        }
        cout<<ans<<endl;
    }
    return 0;
}
/*

*/