#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, m, k, b[805][805], a[805], dis[805], minn = INT_MAX;
bool f[805];
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = (x << 3) + (x << 1) + (ch ^ 48);
		ch = getchar();
	}
	return x * f;
}
inline void write(int x) {
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	if (x > 9)
		write(x / 10);
	putchar(x % 10 + '0');
}
void dijstra(int s) {
	for (int i = 1; i <= m; i++) dis[i] = 0x3f3f3f3f3f3f3f3f;
	memset(f, 0, sizeof(f));
	dis[s] = 0;
	for (int i = 1; i < m; i++) {
		int kill = INT_MAX, u = -1;
		for (int j = 1; j <= m; j++) {
			if (!f[j] && dis[j] < kill) {
				kill = dis[j];
				u = j;
			}
		}
		if (u == -1) break;
		f[u] = 1;
		for (int j = 1; j <= m; j++) {
			if (dis[u] + b[u][j] < dis[j]) dis[j] = dis[u] + b[u][j];
		}
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n >> m >> k;
	memset(b, 0x3f, sizeof(b));
	for (int i = 1; i <= m; i++) b[i][i] = 0;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= k; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		b[u][v] = b[v][u] = w;
	}
	for (int i = 1; i <= m; i++) {
		dijstra(i);
		int ans = 0;
		for (int j = 1; j <= n; j++) ans += dis[a[j]];
		minn = min(minn, ans);
	}
	cout << minn << "\n";
	return 0;
}