#include <stdio.h>
#include <stdlib.h>

#define MAXCITY 200
#define MAXROADS 5000
#define MAXCITYLEN 15

struct TRoad
{	
	int a,b;	
	int len;
} road[MAXROADS];

char city[MAXCITY][MAXCITYLEN+1];
int comp[200];
int n,nocomp;

int roadsort(const void *v1, const void *v2)
{
	struct TRoad *e1=(struct TRoad*)v1,*e2=(struct TRoad*)v2;
	return e1->len-e2->len;
};

int lookup(char *s)
{
	int i;
	for(i=0;i<n;i++)
		if (!strcmp(s,city[i]))
			return i;
	printf("City not found (%s)!\n",s);
	exit(1);
}

void connect(int a, int b)
{
	int i,j;
	if (comp[a]!=comp[b]) {
		nocomp--;
		j=comp[b];
		for(i=0;i<n;i++)
			if (comp[i]==j)
				comp[i]=comp[a];
	}
}	

int main(void)
{
	int i,j,m,c1,c2,noroads;
	char city1[MAXCITYLEN+1],city2[MAXCITYLEN+1],type;
	struct TRoad *r;
	
	scanf("%d %d",&n,&m);
	for(i=0;i<n;i++) {
		scanf("%s",city+i);
		comp[i]=i;
	}
	nocomp=n;
	noroads=0;
	for(i=0;i<m;i++) {
		scanf("%s %s %d %c",&city1,&city2,&j,&type);
		c1=lookup(city1);
		c2=lookup(city2);
		if (type=='M')
			connect(c1,c2);
		else {
			road[noroads].a=c1;
			road[noroads].b=c2;
			road[noroads++].len=j;
		}
	}

	qsort(road,noroads,sizeof(struct TRoad),roadsort);

	j=0;
	r=road;
	while (nocomp>1) {
		if (r-road>=m) { fprintf(stderr,"Graph not connected!\n");
exit(-1); }
		if (comp[r->a]!=comp[r->b]) {
			//printf("%s %s\n",city[r->a],city[r->b]);
			j+=r->len;
			connect(r->a,r->b);
		}
		r++;		
	}
	printf("Den minsta totalsträcka som måste byggas om är %d.\n",j);
	return 0;
}