#include <fstream>

using namespace std;

const int N = 18;
const int INF = 1e9;

int c[N][N], dp[1<<N][N];

int main()
{
    ifstream cin("ubuntzei.in");
    ofstream cout("ubuntzei.out");
    int n, m, t, aux, iii = 1;
    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (i != j)
            {
                c[i][j] = INF;
            }
        }
    }
    cin>>t;
    if (!t)
        iii = 1 + (1<<n-1);
    else
        while (t--)
        {
            cin>>aux;
            iii += (1 << aux - 1);
        }
    for (int i = 0; i < m; i++)
    {
        int x, y, cc;
        cin >> x >> y >> cc;
        c[x - 1][y - 1] = cc;
    }
    cin.close();
    for (int i = 0; i < (1 << n); i++)
    {
        dp[i][0] = 0;
        for (int j = 1; j < n; j++)
        {
            dp[i][j] = INF;
        }
    }
    dp[1][0] = 0;
    for (int i = 1; i < (1 << n); i += 2)
    {
        for (int j = 0; j < n; j++)
        {
            if (((1 << j) & i) && ((!j && i == 1) || j))///j apartine i, deci are sens dp[i][j]
            {
                for (int k = 1; k < n; k++)
                {
                    if (!((1 << k) & i) && c[j][k] != INF)///k e un succesor al lui j
                    {
                        int ii = (i | (1 << k)); /// ii este i reunit cu k
                        dp[ii][k] = min(dp[ii][k], dp[i][j] + c[j][k]);
                    }
                }
            }
        }
    }
//    for (int i = 1; i <= (1 << n); i+=2)
//    {
//        for (int j = 0; j<n; j++)
//            cout<<dp[i][j]<<" ";
//        cout<<endl;
//    }
    int rez = INF;;
    for (int i = 1; i<=(1<<n); i++)
    {
        if ((iii | i) == i)
            rez = min(dp[i][n-1], rez);
    }
    cout<<rez;
    cout.close();
    return 0;
}