//By AKNOIµÄè÷ÇÕ On 2022-07-14
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<stack>
#include<ctime>
#include<cmath>
#include<cctype>
#include<bitset>
#include<vector>
#include<cstdio>
#include<climits>
#include<cstring>
#include<iostream>
#include<algorithm>
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define N 2000005
using namespace std;
ll read(){
	ll x=0,f=1,ch=getchar();
	for(;!isdigit(ch);ch=getchar()) f=(ch=='-')?-1:1;
	for(;isdigit(ch);ch=getchar()) x=(x<<3)+(x<<1)+(ch^48);
	return x*f;
}
void print(ll x){
	if(x<0) putchar('-'),x=~(x-1);
	if(x>9) print(x/10);
	putchar(x%10+48);
}
ll n,m;
ll ATK[N],DEF[N],lena,lend;
ll sum_ATK[N],sum_DEF[N],sum_x[N];
ll stp,Max,Min=INF,x[N],ans;
char s[10];
void init(){
	n=read(),m=read();
	for(int i=1;i<=n;++i){
		scanf("%s",s);
		ll num=read();
		if(s[0]=='A') ATK[++lena]=num;
		if(s[0]=='D') DEF[++lend]=num;
	}
	for(int i=1;i<=m;++i) x[i]=read();
	sort(x+1,x+m+1);
	sort(ATK+1,ATK+lena+1);
	sort(DEF+1,DEF+lend+1);
}
void init_sum(){
	for(int i=1;i<=lena;++i) sum_ATK[i]=sum_ATK[i-1]+ATK[i];
	for(int i=1;i<=lend;++i) sum_DEF[i]=sum_DEF[i-1]+DEF[i];
	for(int i=1;i<=m;++i) sum_x[i]=sum_x[i-1]+x[i];
	ATK[lena+1]=INF;
}
void solve(){
	for(int i=1;i<=m;++i){
		while(x[i]>=ATK[stp]) ++stp;
		--stp;
		Min=min(Min,m+stp-i);
	}
	ans=sum_x[m]-sum_x[m-Min]-sum_ATK[Min];
	if(Min>=lena && m>n){
		stp=1;
		for(int i=1;i<=lend;++i){
			while(DEF[i]>=x[stp]) ++stp;
			x[stp]=0;
		}
		if(stp<=m-Min){
			for(int i=1;i<=m-Min;++i) ans+=x[i];
		}
	}
	for(int i=1;i<Min;++i) ans=max(ans,sum_x[m]-sum_x[m-i]-sum_ATK[i]);
	print(ans);
}
int main(){
//	freopen("T2.in","r",stdin);
//	freopen("T2.out","w",stdout);
	init();
	init_sum();
	solve();
	return 0;
}

rt，求调教调试