#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int n,R,G,P,x[55],y[55],d1[55],d2[55];
bool check(int i,int j){return x[i]!=x[j]&&y[i]!=y[j]&&(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])<=R*R;}
namespace flow
{
const int N=55,M=20000,inf=0x3f3f3f3f;
int s,t,cnt,fi[N],it[N],dep[N],q[N],hd,tl,ne[M],to[M],w[M];
void clear(){cnt=1,memset(fi,0,sizeof(fi));}
void ae(int a,int b,int c){to[++cnt]=b,w[cnt]=c,ne[cnt]=fi[a],fi[a]=cnt;}
void add(int a,int b,int c){ae(a,b,c),ae(b,a,0);}
bool bfs()
{
    memset(dep,0x3f,sizeof(dep)),memcpy(it,fi,sizeof(fi));
    q[hd=tl=1]=s,dep[s]=0;
    while(hd<=tl)
    {
        int u=q[hd++];
        for(int i=fi[u];i;i=ne[i])if(w[i]&&dep[to[i]]==inf)
            dep[to[i]]=dep[u]+1,q[++tl]=to[i];
    }
    return dep[t]!=inf;
}
int dfs(int u,int flow)
{
    if(u==t)return flow;
    int ret=0;
    for(int i=it[u];i&&flow;it[u]=i,i=ne[i])
        if(w[i]&&dep[to[i]]==dep[u]+1)
        {
            int k=dfs(to[i],min(flow,w[i]));
            if(!k)dep[to[i]]=inf;
            w[i]-=k,w[i^1]+=k,ret+=k,flow-=k;
        }
    return ret;
}
int solve()
{
    int ret=0;
    while(bfs())ret+=dfs(s,inf);
    return ret;
}
}//namespace flow
int solve(int*a)
{
    flow::clear(),flow::t=n+1;
    for(int i=1;i<=n;++i)
        if(a[i])flow::add(i,flow::t,P);
        else flow::add(flow::s,i,P);
    for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j)
        if(check(i,j))flow::add(i,j,2*G),flow::add(j,i,2*G);
    return flow::solve();
}
int main()
{
    scanf("%d%d%d%d",&n,&R,&G,&P);
    for(int i=1,d;i<=n;++i)
        scanf("%d%d%d",x+i,y+i,&d),d/=90,d1[i]=d==1||d==2,d2[i]=d==2||d==3;
    int ans=P*n;
    for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j)
        if(check(i,j))ans+=2*G;
    ans-=solve(d1)+solve(d2);
    // cerr<<solve(d1)<<' '<<solve(d2)<<'\n';
    printf("%d\n",ans);
}