#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
const int N=55;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
queue<int>Q;
vector<pair<int,int>>g[N*N];
int id[N][N],s,p,t,terminal[N],dis[N*N],len[N],go[N][55],tot,len2[N],cir[N];
bool vis[N*N];
void add(int x,int y,int z){g[x].pb(mp(y,z));}
void bfs(int S,int len[],bool can_cap)
{
    rep(i,s)len[i]=-1;
    Q.push(S);len[S]=0;
    for(;!Q.empty();)
    {
        int u=Q.front();Q.pop();
        for(int i=0;i<52;i++)if(go[u][i])
        {
            if(!can_cap&&i<26)continue;
            int x=go[u][i];
            if(len[x]!=-1)continue;
            len[x]=len[u]+1;
            Q.push(x);
        }
    }
}
int main()
{
    scanf("%d%d%d",&s,&p,&t);
    rep(i,p)scanf("%d",&terminal[i]);
    rep(i,t)
    {
        int x,y;char s[2];
        scanf("%d%s%d",&x,s,&y);
        char c=s[0];
        int typ;
        if('A'<=c&&c<='Z')typ=c-'A';else typ=c-'a'+26;
        go[x][typ]=y;
    }
    rep(i,s)rep(j,s)id[i][j]=++tot;
    rep(i,s)rep(j,s)
    {
        for(int k=26;k<52;k++)if(go[i][k])add(id[go[i][k]][j],id[i][j],1);
        for(int k=26;k<52;k++)if(go[j][k])add(id[i][go[j][k]],id[i][j],1);
        for(int k=0;k<26;k++)if(go[i][k]&&go[j][k])add(id[go[i][k]][go[j][k]],id[i][j],2);
    }
    rep(i,tot)dis[i]=-1;
    rep(i,p)rep(j,p)
    {
        int x=id[terminal[i]][terminal[j]];
        dis[x]=0;
        q.push(mp(0,x));
    }
    for(;!q.empty();)
    {
        int u=q.top().second;q.pop();
        if(vis[u])continue;
        vis[u]=1;
        for(auto [x,y]:g[u])if(dis[x]==-1||dis[u]+y<dis[x])dis[x]=dis[u]+y,q.push(mp(dis[x],x));
    }
    rep(i,s)
    {
        bfs(i,len,0);
        cir[i]=-1;
        rep(j,s)for(int k=26;k<52;k++)if(go[j][k]==i&&j!=s&&len[j]!=-1&&(cir[i]==-1||cir[i]>len[j]+1))cir[i]=len[j]+1;
    }
    bfs(1,len,1);
    int ans=-1;
    rep(i,s)
    {
        if(len[i]==-1)continue;
        for(int j=26;j<52;j++)for(int k=26;k<52;k++)
        {
            if(j==k)continue;
            if(!go[i][j]||!go[i][k])continue;
            int x=go[i][j],y=go[i][k],now=id[x][y];
            if(dis[now]==-1)continue;
            int tans=len[i]*2+dis[now]+2;
            if(ans==-1||tans<ans)ans=tans;
        }
        if(cir[i]!=-1&&dis[id[i][i]]!=-1&&(ans==-1||ans>len[i]*2+cir[i]+dis[id[i][i]]))ans=len[i]*2+cir[i]+dis[id[i][i]];
        bfs(i,len2,0);
        for(int j=0;j<26;j++)if(go[i][j])rep(k,s)if(go[k][j])
        {
            if(k==i)continue;
            if(len2[k]==-1)continue;
            int x=id[go[i][j]][go[k][j]];
            if(dis[x]==-1)continue;
            int tans=len[i]*2+len2[k]+2+dis[x];
            if(ans==-1||ans>tans)ans=tans;
        }
    }
    printf("%d\n",ans);
    return 0;
}