#include<bits/stdc++.h>
using namespace std;
#define pi pair<int,int>
#define fi first 
#define se second 
#define pb push_back
#define int long long
const int mod=998244353;
inline int read(){
    char ch=getchar();int x=0;bool f=0;
    for(;!isdigit(ch);ch=getchar())if(ch=='-')f=1;
    for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
    if(f==1)x=-x;return x;
}
const int maxn=1e5+5,M=100;
int n,m,q,a[maxn],flag[maxn],b[maxn];
int f[maxn],x;
int u[maxn],v[maxn],w[maxn],ans=0;
multiset<int>s[maxn];
vector<pi>e[maxn],g[maxn];
signed main(){
    n=read(),m=read();q=read();
    for(int i=1;i<=n;i++)a[i]=read();
    for(int i=1;i<=m;i++){
        u[i]=read(),v[i]=read(),w[i]=read();
        e[u[i]].pb({v[i],w[i]}),e[v[i]].pb({u[i],w[i]});
    }
    for(int i=1;i<=n;i++){
        if(e[i].size()>M){
            flag[i]=1;
            for(auto j:e[i]){
                g[j.fi].pb({i,j.se});
                s[i].insert(j.se);
            }
        }
    }
    for(int i=1;i<=q;i++)b[i]=read();
    for(int i=q;i>=1;i--){
        x=b[i];
        for(auto j:g[x]){
            s[j.fi].erase(s[j.fi].lower_bound(f[x]+j.se));
        }
        if(flag[x]){
            f[x]=*s[x].begin();
        }
        else{
            int z=1e15;
            for(auto j:e[x])z=min(z,f[j.fi]+j.se);
            f[x]=z;
        }
        for(auto j:g[x]){
            s[j.fi].insert(f[x]+j.se);
        }
    }
    for(int i=1;i<=n;i++)ans=(ans+f[i]%mod*a[i])%mod;
    cout<<ans<<endl;
    return 0;

}