//
/*
By:Luckyblock
*/
#include <bits/stdc++.h>
#define LL long long
#define pr std::pair
#define pii std::pair<int,int>
#define mp std::make_pair
const LL kInf = 1e18 + 2077;
const int kN = 2e5 + 10;
const LL p = 998244353;
//=============================================================
int n, m, q, a[kN], target[kN];
std::vector<pii> edge[kN];
int lim, du[kN], type[kN];

int nowtime, tag[kN];
struct node {
  LL val;
  int v, w, tim;
  bool operator < (const node& sec_) const {
    return val < sec_.val;
    // if (val != sec_.val) return val < sec_.val;
    // if (tim != sec_.tim) return tim < sec_.tim;
    // return w < sec_.w;
  }
};
std::set<node> s[kN];
int out[kN];
LL val[kN], cost[kN];
//=============================================================
void init() {
  lim = sqrt(m);
  for (int i = 1; i <= n; ++ i) {
    if (du[i] > lim) {
      type[i] = 1;
      for (auto [v, w]: edge[i]) s[i].insert((node) {w, v, w, 0});
    }
  }
}
void solve() {
  for (int i = q; i; -- i) {
    int u = target[i], o, c;
    LL minval = kInf;
    if (type[u]) {
      auto top = *s[u].begin();
      while (tag[top.v] != top.tim) {
        s[u].erase(s[u].begin());
        s[u].insert((node) {val[top.v] + top.w, top.v, top.w, tag[top.v]});
        top = *s[u].begin();
      }
      minval = top.val, o = top.v, c = top.w;
    } else {
      for (auto [v, w]: edge[u]) {
        if (val[v] + w < minval) {
          minval = val[v] + w, o = v, c = w;
        }
      }
    }
    out[i] = o, cost[i] = c;
    val[u] += minval, tag[u] = ++ nowtime;
  }
}
//=============================================================
int main() {
  // freopen("1.txt", "r", stdin);
  std::ios::sync_with_stdio(0), std::cin.tie(0);
  std::cin >> n >> m >> q;
  for (int i = 1; i <= n; ++ i) std::cin >> a[i];
  for (int i = 1; i <= m; ++ i) {
    int u, v, w; std::cin >> u >> v >> w;
    edge[u].push_back(mp(v, w));
    edge[v].push_back(mp(u, w));
    ++ du[u], ++ du[v];
  }
  for (int i = 1; i <= q; ++ i) std::cin >> target[i];
  init(), solve();

  LL ans = 0;
  for (int i = 1; i <= q; ++ i) {
    int u = target[i];
    ans = (ans + 1ll * a[u] % p * cost[i] % p) % p;
    a[out[i]] = (a[out[i]] + a[u]) % p; 
    a[u] = 0;
  }
  std::cout << ans << "\n";
  return 0;
}