#include<iostream>
#include<queue>
#include<cstdio>
#include<vector>
#include<map>
#include<cmath>
#include<cstring>

using namespace std;
const int maxn = 2e4+5;
const int INF = 0x3f3f3f3f;
const double eps = 1e-4;

struct Edge
{
    int from, to, cap, flow, cost;
};

struct MCMF
{
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> G[maxn];
    int inq[maxn];//是否在队列
    int d[maxn];//Bellman-Ford用
    int p[maxn];//上一条弧
    int a[maxn];//可改进量

    void init(int n)
    {
        this->n=n;
        for(int i=0; i<n; ++i)
            G[i].clear();
        edges.clear();
    }

    void AddEdge(int from, int to, int cap, int cost)
    {
        edges.push_back((Edge)
        {
            from, to, cap, 0, cost
        });
        edges.push_back((Edge)
        {
            to, from, 0, 0, -cost
        });
        m=edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    bool BellmanFord(int s, int t, int &flow, int& cost)
    {
        for(int i=0; i<n; ++i)
            d[i]=INF;
        memset(inq,0,sizeof(inq));
        memset(p,0,sizeof(p));
        d[s]=0;
        inq[s]=1;
        p[s]=0;
        a[s]=INF;

        queue<int> Q;
        Q.push(s);
        while(!Q.empty())
        {
            int u=Q.front();
            Q.pop();
            inq[u]=0;
            for(int i=0; i<G[u].size(); ++i)
            {
                Edge& e=edges[G[u][i]];
                if(e.cap > e.flow && d[e.to] > d[u] + e.cost)
                {
                    d[e.to]=d[u]+e.cost;
                    p[e.to]=G[u][i];
                    a[e.to]=min(a[u],e.cap-e.flow);
                    if(!inq[e.to])
                    {
                        Q.push(e.to);
                        inq[e.to]=1;
                    }
                }
            }
        }
        if(d[t]==INF)
            return false;
        flow+=a[t];
        cost+=d[t]*a[t];
        int u=t;
        while(u!=s)
        {
            edges[p[u]].flow+=a[t];
            edges[p[u]^1].flow-=a[t];
            u=edges[p[u]].from;
        }
        return true;
    }

    int MinCost(int s, int t)
    {
        int flow=0, cost=0;
        while(BellmanFord(s,t,flow,cost))
        {
        }
        return cost;
    }
} mcmf;

class Person
{
public:
    int x, y, num;
    string name;

    Person() {}

    Person(int a, int b, int c, string str):x(a), y(b), num(c), name(str)
    {
    }
};

int k, n, s, t;
int grap[100][100];
map<string, int> msi;
vector<Person> persons;

double Slope(Person& p1, Person& p2)
{
    if(p1.x==p2.x)
        return INF;
    return 1.0*(p1.y-p2.y)/(p1.x-p2.x);
}

int GetDis(Person& p1, Person& p2)
{
    int maxx=p1.x, maxy=p1.y, minx=p2.x, miny=p2.y;
    double sp=Slope(p1, p2);
    if(maxx<minx) swap(maxx, minx);
    if(maxy<miny) swap(maxy, miny);
    for(int i=0; i<persons.size(); ++i)
    {
        if(i==p1.num || i==p2.num) continue;
        Person& p3=persons[i];
        if(p3.x<=maxx && p3.x>=minx && p3.y<=maxy && p3.y>=miny && abs(sp-Slope(p1, p3))<=eps)
            return INF;
    }
    return (p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y);
}

void trans(string& str)
{
    for(int i=0; i<str.size(); ++i)
        if(str[i]>=‘A‘ && str[i]<=‘Z‘)
            str[i]+=32;
}

void Init()
{
    msi.clear();
    persons.clear();
    for(int i=0; i<100; ++i)
        for(int j=0; j<100; ++j)
            grap[i][j]=1;
    cin>>k>>n;
    k*=k;
    int x, y, fate, dis;
    string name, name2;
    s=2*n;
    t=s+1;
    mcmf.init(t+1);
    for(int i=0; i<2*n; ++i)
    {
        cin>>x>>y>>name;
        trans(name);
        persons.push_back(Person(x, y, i, name));
        if(i<n)
            mcmf.AddEdge(s, i, 1, 0);
        else
            mcmf.AddEdge(i, t, 1, 0);
        msi[name]=i;
    }
    while(cin>>name)
    {
        if(name=="End")
            break;
        trans(name);
        cin>>name2>>fate;
        trans(name2);
        int p1=msi[name], p2=msi[name2];
        if(p1>p2) swap(p1, p2);
        grap[p1][p2]=fate;
    }
    for(int i=0; i<n; ++i)
        for(int j=n; j<2*n; ++j)
        {
            dis=GetDis(persons[i], persons[j]);
            if(dis<=k)
                mcmf.AddEdge(i, j, 1, -grap[i][j]);
        }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    Init();
    cout<<-mcmf.MinCost(s, t)<<endl;
    return 0;
}