#include<bits/stdc++.h>
using namespace std;
const int N=1919810,mod=998244353;
typedef long long ll;
typedef pair<ll,ll> PII;
ll n,m,k;
ll a[N],b[N];
char s[N];
vector<PII> e[N];
int q[N];
priority_queue<int> pq[N];
ll dp[N];
ll mned[N];

int main(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
    for(int i=1;i<=m;i++){
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        e[u].push_back({v,w});
        e[v].push_back({u,w});
    }    
    int B=400;
    for(int i=1;i<=k;i++) scanf("%d",&q[i]);
    // memset(mned,0x3f,sizeof mned);
    for(int i=1;i<=n;i++){
        if(e[i].size()>B)
        for(auto [j,w]:e[i]){
            pq[i].push(w);
        }
    }
    for(int i=k;i>=1;i--){
        int t=q[i];
        if(e[t].size()<=B){
            ll mn=1e18;
            for(auto [j,w]:e[t]) mn=min(mn,dp[j]+w);
            dp[t]=mn;
            for(auto [j,w]:e[t]){
                if(e[j].size()>B){
                    pq[j].push(w+dp[t]);
                }
            }
        }else{
            dp[t]=pq[t].top();
        }
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
        // cout<<dp[i]<<" ";
        ans=(ans+dp[i]*a[i])%mod;
    }
    cout<<ans<<endl;
}