#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>

using namespace std;

typedef long long LL;

const int N = 50010, M = 200010, mod = 1000000007;

int n, m;
int h[N], w[M], e[M], ne[M], tp[M], idx;
int d[N], a[N];
int cnt;
bool st[N];
map<int, LL> dis[N][3];

inline void add(int a, int b, int c, int d)
{
	e[idx] = b, w[idx] = c, tp[idx] = d;
	ne[idx] = h[a], h[a] = idx ++ ;
}

int main()
{
	scanf("%d%d", &n, &m);
	int S = sqrt(n);
	for (int i = 1; i <= m; i ++ )
	{
		int x, y, z, typ;
		char op[5];
		scanf("%d%d%d%s", &x, &y, &z, op);
		if (*op == 'R') typ = 0;
		else if (*op == 'G') typ = 1;
		else typ = 2;
		dis[x][typ][y] += z, dis[y][typ][x] += z;
		add(x, y, z, typ);
		add(y, x, z, typ);
		d[x] ++ , d[y] ++ ;
	}
	
	LL ans = 0;
	for (int i = 1; i <= n; i ++ )
		if (d[i] > S) a[ ++ cnt] = i;
	
	for (int i = 1; i <= cnt; i ++ )
	{
		int x = a[i];
		for (int j = 1; j <= cnt; j ++ )
			if (dis[x][0][a[j]])
			{
				int y = a[j];
				LL t1 = dis[x][0][y];
				for (int k = 1; k <= cnt; k ++ )
					if (dis[y][1][a[k]])
					{
						int z = a[k];
						ans = (ans + t1 * dis[y][1][z] % mod * dis[z][2][x]) % mod;
					}
			}
	}
	
	for (int x = 1; x <= n; x ++ )
		if (d[x] <= S)
		{
			st[x] = true;
			for (int i = h[x]; ~i; i = ne[i])
			{
				int j = e[i];
				if (!st[j])
				{
					LL t = w[i];
					for (int k = ne[i]; ~k; k = ne[k])
					{
						int v = e[k];
						if (!st[v] && tp[i] != tp[k] && j != v)
							ans = (ans + t * w[j] % mod * dis[j][3 - tp[i] - tp[k]][v]) % mod; 
					}
				}
			}
		}
	
	printf("%lld\n", ans);
	return 0;
}