#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define N 100010
#define M 200010
#define B 1200
#define P 998244353

inline int read()
{
    int x=0;
    char c=getchar();
    while(c<'0'||c>'9') c=getchar();
    while('0'<=c&&c<'9') {
        x=(x<<3)+(x<<1)+(c^48);
        c=getchar();
    }
    return x;
}

struct edg {
    int v;
    ll w,dp;
    bool operator<(const edg& oth)const {
        return dp>oth.dp;
    }
};
vector<edg> mp[N],big[N];
int du[N];

int n,m,q;
int a[N],b[N];
ll dp[N];

priority_queue<edg> pq[N];

void solve()
{
    n=read(),m=read(),q=read();
    for(int i=1; i<=n; ++i) a[i]=read();
    for(int i=1,u,v,w; i<=m; ++i) {
        u=read(),v=read(),w=read();
        mp[u].emplace_back(edg {v,w,0ll});
        mp[v].emplace_back(edg {u,w,0ll});
        du[u]++;
        du[v]++;
    }
    for(int i=1; i<=q; ++i) b[i]=read();

    for(int i=1; i<=n; ++i) for(const edg& e:mp[i]) {
            if(du[e.v]>B) big[i].emplace_back(e.v);
        }
    for(int i=1; i<=n; ++i) if(du[i]>B) {
            for(const edg& e:mp[i]) pq[i].push(edg {e.v,0,e.w});
        }
    for(int i=q; i; --i) {
        int u=b[i];
        if(du[u]<=B) {
            dp[u]=1e18;
            for(const edg& e:mp[u]) dp[u]=min(dp[u],dp[e.v]+e.w);
        } else {
            while(!pq[u].empty()) {
                edg e=pq[u].top();
                if(dp[e.v]==e.w) {
                    dp[u]=e.dp;
                    break;
                } else pq[u].pop();
            }
        }

        for(const edg& e:big[u]) {
            pq[e.v].push(edg {u,dp[u],dp[u]+e.w});
        }
    }

    ll ans=0;
    for(int i=1; i<=q; ++i) {
        int u=b[i];
        ans=(ans+dp[u]*a[u]%P)%P;
        dp[u]=0;
    }
    cout<<ans;
}

signed main()
{
//    std::cin.tie(nullptr) -> sync_with_stdio(false);
    int T = 1;
//    std::cin >> T;
//    while(T--)
    solve();
    return 0;
}