/* 
 * Problem: 丘比特的煩惱
 * Author: Guo Jiabao
 * Time: 2009.3.24 12:49
 * State: Solved
 * Memo: KM O(N^3) with slack
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
const int MAXN=61,MAXL=21,INF=0x7FFFFFFF;
using namespace std;
struct Person
{
	char Name[MAXL];
	int x,y;
}P[MAXN];
int N,M,T,Distance;
int adj[MAXN][MAXN],Match[MAXN],L[MAXN];
int slack[MAXN];
bool vis[MAXN];
inline int dist2(int x1,int y1,int x2,int y2)
{
	return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2);
}
inline bool iscross(int a,int b,int c)
{
	if ((P[a].x-P[b].x)*(P[b].y-P[c].y) == (P[b].x-P[c].x)*(P[a].y-P[b].y)) //共線
	{
		if (P[a].y==P[c].y)
			return (P[a].x < P[b].x && P[b].x < P[c].x)||(P[c].x < P[b].x && P[b].x < P[a].x);
		else
			return (P[a].y < P[b].y && P[b].y < P[c].y)||(P[c].y < P[b].y && P[b].y < P[a].y);
	}
	return false;
}
void shot()
{
	int i,j,k;
	for (i=1;i<=N;i++)
		for (j=M;j<=T;j++)
		{
			if (dist2(P[i].x,P[i].y,P[j].x,P[j].y)>Distance*Distance)
				adj[i][j]=0;
			else
			{
				for (k=1;k<=T;k++)
					if (k!=i && k!=j && iscross(i,k,j))
						break;
				adj[i][j]=k>T?1:0;
			}
		}
}
inline int scanname(char *S)
{
	for (int i=1;i<=T;i++)
		if (strcmp(P[i].Name,S)==0)
			return i;
}
void format(char *s)
{
	for (;*s;s++)
		if (*s>='a' && *s<='z')
			*s=*s-'a'+'A';
}
void init()
{
	int i,a,b,c,v;char Name[MAXL];
	freopen("cupid.in","r",stdin);
	freopen("cupid.out","w",stdout);
	scanf("%d%d",&Distance,&N);
	M=N+1;T=N+N;
	for (i=1;i<=T;i++)
	{
		scanf("%d%d%s",&P[i].x,&P[i].y,P[i].Name);
		format(P[i].Name);
	}
	shot();
	while (scanf("%s",Name)!=EOF)
	{
		if (strcmp(Name,"End")==0) break;
		format(Name);
		a=scanname(Name);
		scanf("%s",Name);format(Name);
		b=scanname(Name);
		scanf("%d",&v);
		if (a>b) {c=a;a=b;b=c;}
		if (adj[a][b]!=0)
			adj[a][b]=v;
	}
}
bool path(int i)
{
	vis[i]=true;
	for (int j=M;j<=T;j++)
	{
		if (!vis[j] && adj[i][j]>0)
		{
			int t=L[i]+L[j]-adj[i][j];
			if (t==0)
			{
				vis[j]=true;
				if (Match[j]==0 || path(Match[j]))
				{
					Match[j]=i;
					return true;
				}
			}
			else if (t<slack[j])
				slack[j]=t;
		}
	}
	return false;
}
void KM()
{
	int i,j,k,delta;
	memset(L,0,sizeof(L));
	memset(Match,0,sizeof(Match));
	for (i=1;i<=N;i++)
		for (j=M;j<=T;j++)
			if (adj[i][j]>L[i])
				L[i]=adj[i][j];
	for (i=1;i<=N;i++)
	{
		for (;;)
		{
			memset(vis,0,sizeof(vis));
			for (j=M;j<=T;j++)
				slack[j]=INF;
			if (path(i)) break;
			delta=INF;
			for (k=M;k<=T;k++)
				if (!vis[k] && slack[k]<delta)
					delta=slack[k];
			for (j=1;j<=N;j++)
				if (vis[j])
					L[j]-=delta;
			for (j=M;j<=T;j++)
				if (vis[j])
					L[j]+=delta;
		}
	}
}
void print()
{
	int i,Ans=0;
	for (i=M;i<=T;i++)
		Ans+=adj[Match[i]][i];
	printf("%d\n",Ans);
}
int main()
{
	init();
	KM();
	print();
	return 0;
}