#include<stdio.h>
#include<string>
#include<map>
#include<string.h>
#include<algorithm>

using namespace std;

int cnt = 0;
bool needtoplus = 0;
struct TREE {
    TREE *children[26];
    int max=-1;

    void insert(string &a,int i,int val)
    {
        if (max < val)
        {
            needtoplus = 0;
            max = val;
        }
        if (needtoplus) cnt++;

        int num = a[i]- 'A';
        if (children[num] == NULL){
            children[num] = new TREE();
        }
        if( i!=a.length()-1) children[num]->insert(a,i+1, val);
    }

};

struct QUERY {
    string word;
    int val;
    bool operator< (const QUERY &a)
    {
        if (val == a.val){
            return word.compare(a.word) < 0;
        }
        return val > a.val;
    }
}; QUERY Q[10001];
map<string, int> m;

int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        int N, M,val;
        char temp[41];
        scanf("%d %d", &N, &M);
        for (int i = 0; i < N; i++)
        {
            scanf("%s %d", temp, &val);
            Q[i].word = temp;
            Q[i].val = val;
        }
        sort(Q, Q + N);
        TREE *root = new TREE();
        root->max = 999999;

        for (int i = 0; i < N; i++)
        {
            cnt = 0;
            needtoplus = 1;
            root->insert(Q[i].word,0, Q[i].val);
            Q[i].val = cnt;
            m[Q[i].word] = Q[i].val + !needtoplus;
        }

        int answer = 0;

        for (int i = 0; i < M; i++)
        {
            scanf("%s", temp);
            if(m.find(temp)!=m.end())answer += m[temp];
            else answer += strlen(temp);
        }
        printf("%d\n", answer + M - 1);
        m.clear();
        delete root;

    }
    return 0;
}