#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define mod 998244353
int qread() {
  int res = 0, flg = 1;
  char c = getchar();
  while(!isdigit(c)) {
    if(c == '-') flg = 0;
    c = getchar();
  }
  while(isdigit(c)) {
    res = (res << 3) + (res << 1) + (c ^ 48);
    c = getchar();
  }
  return flg ? res : -res;
}
const int N = 1e5 + 10;
int du[N];
struct cmp{
  bool operator()(pii a, pii b) {
    return a.se > b.se;
  }
};
vector<pii> vec[N];
priority_queue<pii, vector<pii>, cmp> prq[N];
map<int, int> ma[N];
int n, m, q, lim;
int a[N];
int ord[N], waste[N];
void update(int u) {
  int to, w;
  for(int i = 0; i < vec[u].size(); ++i) {
    to = vec[u][i].fi, w = vec[u][i].se;
    if(du[to] < lim) break;
    prq[to].push({u, w + waste[u]});
    ma[to][u] = w + waste[u];
  }
}
pii find(int u) {
  if(du[u] < lim) {
    int to, w;
    int rt, rw = 0x3f3f3f3f3f3f3f3f;
    for(int i = 0; i < vec[u].size(); ++i) {
      to = vec[u][i].fi, w = vec[u][i].se;
      if(w + waste[to] < rw) {
        rt = to, rw = w + waste[to];
      }
    }
    return {rt, rw};
  }
  while(ma[u][prq[u].top().fi] != prq[u].top().se) {
    prq[u].pop();
  }
  return prq[u].top();
}

signed main() {
  n = qread(), m = qread(), q = qread();
  lim = 1000;
  //lim = 0;
  int u, v, w;
  for(int i = 1; i <= n; i++) a[i] = qread();
  for(int i = 1; i <= m; i++) {
    u = qread(), v = qread(), w = qread();
    du[u]++; du[v]++;
    vec[u].push_back({v, w});
    vec[v].push_back({u, w});
  }
  for(int i = 1; i <= n; i++) {
    sort(vec[i].begin(), vec[i].end(), [](pii a, pii b)->bool{
      return du[a.fi] > du[b.fi];
    });
    update(i); 
  }
  for(int i = 1; i <= q; ++i) ord[i] = qread();
  
  pii nxt;
  for(int i = q; i; --i) {
    nxt = find(ord[i]);
    waste[ord[i]] = nxt.se;
    update(ord[i]);
  }
  
  int res = 0;
  for(int i = 1; i <= n; i++) {
    res = (res + a[i] % mod * waste[i] % mod) % mod;
  }
  cout << res << '\n';
  return 0;
}
/*
3 2 2
1 1 1
2 3 10
1 2 1
3 2
*/