#include<bits/stdc++.h>
#define mp(a,b) make_pair(a,b)
using namespace std;
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;
}
typedef long long LL;
typedef pair<int,int> pii;
const int N = 1e5+7;
const LL INF = 1e15;
const int mod = 998244353;
int n,m,q;
vector<pii> E[N];
vector<pii> big[N]; //u 连了哪些大点
set<pair<LL, int> > g[N];  //大点u 的 f集合
void gmin(LL &x,LL y) {
    x = min(x, y);
}
signed main()
{
    n = read(), m = read(), q = read();
    vector<int> deg(n+1, 0), a(n+1, 0);
    for(int i=1;i<=n;++i) a[i] = read();
    for(int i=1;i<=m;++i) {
        int u = read(), v = read(), w = read();
        E[u].push_back(mp(v, w));
        E[v].push_back(mp(u, w));
        ++deg[u], ++deg[v];
    }
    int B = 300;
    for(int i=1;i<=n;++i) {
        if(deg[i] >= B) {
            for(auto [v, w] : E[i]) {
                big[v].push_back(mp(i, w));
                g[i].insert(mp(w, v));
            }
        }
    }
    vector<int> b(q, 0);
    for(int i=0;i<q;++i) b[i] = read();
    vector<LL> f(n+1, 0);
    for(int i=q-1;i>=0;--i) {
        int u = b[i];
        LL last = f[u];
        f[u] = INF;
        if(deg[u] <= B) {
            for(auto [v, w] : E[u]) {
                gmin(f[u], f[v]+w);
            }
        } else {
            f[u] = (*g[u].begin()).first;
        }
        for(auto [v, w] : big[u]) {
            g[v].erase(mp(last+w, u));
            g[v].insert(mp(f[u]+w, u));
        }
    }
    LL ans = 0;
    for(int i=1;i<=n;++i) ans = (ans + (LL)(f[i]%mod)*a[i]%mod) % mod;
    cout << ans << endl;
    return 0;
}