#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, q, a[100010], b[100010], d[100010], ww[100010], vis[100010];
vector<ll>e[100010], w[100010];
vector<pair<ll,ll>>da[100010];
multiset<ll>s[100010];
const ll mod = 998244353;
int main() {
	scanf("%lld %lld %lld", &n, &m, &q);
	for (ll i = 1; i <= n; i++) {
		scanf("%lld", &a[i]);
	}
	for (ll i = 1; i <= m; i++) {
		ll u, v, www;
		scanf("%lld %lld %lld", &u, &v, &www);
		e[u].push_back(v);
		w[u].push_back(www);
		e[v].push_back(u);
		w[v].push_back(www);
	}
	for (ll i = 1; i <= q; i++) {
		scanf("%lld", &b[i]);
	}
	ll lj = sqrtl(2 * m);
	for (ll i = 1; i <= n; i++) d[i] = e[i].size();
	for (ll i = 1; i <= n; i++) if (d[i] > lj) vis[i] = 1;
	for (ll i = 1; i <= n; i++)
		for (ll j = 0; j < e[i].size();j++)
		{
			if (vis[e[i][j]])
				da[i].push_back({ e[i][j],w[i][j]});
			if (vis[e[i][j]])
				s[i].insert(w[i][j]);
		}
	for (ll i = q; i >= 1; i--) {
		ll x = b[i];
		if (d[x] <= lj) {
			ll minn = 1e18;
			for (ll j = 0; j < d[x]; j++) {
				minn = min(minn, ww[e[x][j]] + w[x][j]);
			}
			for (ll nx : e[x]) {
				if (vis[nx]) {
					s[nx].erase(s[nx].find(ww[x]));
					s[nx].insert(minn);
				}
			}
			ww[x] = minn;
		}
		else {
			ll minn = (*s[x].begin());
			for (pair<ll,ll> nx : da[x]) {
					s[nx.first].erase(s[nx.first].find(ww[x] + nx.second));
					s[nx.first].insert(minn + nx.second);
			}
			ww[x] = minn;
		}
		//for (int i = 1; i <= n; i++)
		//	cout << ww[i] << " \n"[i == n];
	}
	ll ans = 0;
	for (ll i = 1; i <= n; i++)
	{
		//cout << ww[i] << " \n"[i == n];
		ans = (ans + ww[i] % mod * a[i]) % mod;
	}
	cout << ans;
}