#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<array>
#include<set>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
void speed()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}
vector<pii>edge[100005];
multiset<ll>s[100005];
ll a[100005];
ll b[100005];
ll in[100005];
ll dp[100005];
constexpr ll mod = 998244353;
int main()
{
	ll n, m, q;
	cin >> n >> m >> q;
	ll B = sqrt(m);
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	for (int i = 1; i <= m; i++)
	{
		ll u, v, w;
		cin >> u >> v >> w;
		edge[u].push_back({ v,w });
		edge[v].push_back({ u,w });
		in[u]++;
		in[v]++;
	}
	for (int i = 1; i <= q; i++)
	{
		cin >> b[i];
	}
	for (int i = 1; i <= n; i++)
		sort(edge[i].begin(), edge[i].end(), [&](pii a, pii b) {return in[a.first] > in[b.first]; });
	for (int i = 1; i <= n; i++)
	{
		if (in[i]>B)
		{
			for (auto j : edge[i])
			{
				if (in[j.first] <= B)
					s[i].insert(j.second);
			}
		}
	}
	for (int i = q; i >= 1; i--)
	{
		if (in[b[i]]<=B)
		{
			for (auto j : edge[b[i]])
			{
				if (in[j.first] > B)s[j.first].erase(s[j.first].find(dp[b[i]]+j.second));
			}
			dp[b[i]] = 1e18;
			for (auto j : edge[b[i]])
			{
				dp[b[i]] = min(dp[b[i]], dp[j.first] + j.second);
			}
			for (auto j : edge[b[i]])
			{
				if (in[j.first] > B)s[j.first].insert(dp[b[i]] + j.second);
			}
		}
		else
		{
			dp[b[i]] = *s[b[i]].begin();
			for (auto j : edge[b[i]])
			{
				if (in[j.first] <= B) break;
				dp[b[i]] = min(dp[b[i]], dp[j.first] + j.second);
			}
		}
	}
	ll ans = 0;
	for (int i = 1; i <= n; i++)
	{
		ans = (ans + dp[i] % mod * a[i] % mod) % mod;
	}
	cout << ans << endl;
	return 0;
}