#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const int N = 100010;
const int M = 200010;
const int B = 300;
const int p = 998244353;
const LL inf = 1e18;

int n, m, q, cnt, head[N], nxt[M], to[M], w[M], d[N];
LL a[N], b[N], f[N];
vector < pair<int, LL> > e[N];
multiset <LL> s[N];

inline void addedge(int u, int v, int k)
{
    to[++cnt] = v, w[cnt] = k;
    nxt[cnt] = head[u], head[u] = cnt;
}

signed main()
{
    scanf("%d%d%d", &n, &m, &q);

    for(int i = 1; i <= n; i++) scanf("%lld", a + i);

    for(int i = 1; i <= m; i++){
        int u, v, k;
        scanf("%d%d%d", &u, &v, &k);
        addedge(u, v, k), addedge(v, u, k);
        d[u]++, d[v]++;
    }
    for(int u = 1; u <= n; u++){
        for(int i = head[u]; i; i = nxt[i]){
            int v = to[i];
            if(d[v] > B) e[u].emplace_back(make_pair(v, w[i]));
        }
    }

    for(int x = 1; x <= n; x++){
        for(int i = head[x]; i; i = nxt[i]){
            int v = to[i];
            if(d[v] <= B) s[x].insert(w[i]);
        }
    }

    for(int i = 1; i <= q; i++) scanf("%lld", b + i);

    for(int i = q; i; i--){
        int x = b[i];
        if(d[x] <= B){
            LL val = inf;
            for(int j = head[x]; j; j = nxt[j]){
                int v = to[j];
                val = min(val, f[v] + w[j]);
            }
            for(int j = head[x]; j; j = nxt[j]){
                int v = to[j];
                if(d[v] > B){
                    auto u = s[v].lower_bound(f[x] + w[j]);
                    s[v].erase(u);
                    s[v].insert(val + w[j]);
                }
            }
            f[x] = val;
        }
        else{
            LL val = inf;
            for(auto v : e[x]) val = min(val, f[v.first] + v.second);
            val = min(val, *s[x].begin());
            f[x] = val;
        }
    }

    LL ans = 0;
    for(int i = 1; i <= n; i++) ans += (1ll * a[i] * f[i]) % p, ans %= p;
    printf("%lld\n", ans);
    return 0;
}