#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=100005,P=998244353;
const ll INF=0x3f3f3f3f3f3f3f3f;
int n,m,q,a[N],b[N],ans;
ll f[N],g[N];
vector<pair<int,int>> e[N];
int read() {
    int x=0,f=1; char c=getchar();
    for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
    for(;c>='0'&&c<='9';c=getchar()) x=x*10+c-48;
    return x*f;
}
int main() {
    n=read(); m=read(); q=read();
    for(int i=1;i<=n;i++) a[i]=read();
    for(int i=1;i<=m;i++) {
        int x=read(),y=read(),z=read();
        e[x].push_back({y,z});
        e[y].push_back({x,z});
    }
    for(int i=1;i<=q;i++) b[i]=read();
    f[b[q]]=INF;
    for(int i=q;i>=1;i--) {
        for(int j=1;j<=n;j++) g[j]=f[j];
        for(int x=1;x<=n;x++) {
            for(auto [y,z]:e[x]) {
                g[x]=min(g[x],f[y]+z);
            }
        }
        g[b[i-1]]=INF;
        for(int j=1;j<=n;j++) f[j]=g[j];
    }
    for(int i=1;i<=n;i++) ans=(ans+f[i]%P*a[i])%P;
    printf("%d\n",ans);
    return 0;
}