#include <bits/stdc++.h>
#define int long long

using namespace std;

const int N = 1e5 + 10;
const int mod = 998244353;
int n, m, q;
int a[N];
// vector<int> path1[N];

vector<pair<int, int>> path[N];
int deg[N];
int f[N], b[N];
multiset<int> g[N];

struct Edge {
    int u, v, w;
}e[N];

int add(int x, int y) {
    return x + y >= mod ? x + y - mod : x + y;
}

signed main() {
    scanf("%lld%lld%lld", &n, &m, &q);
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", &a[i]);
    }
    for (int i = 1; i <= m; ++i) {
        // int u, v, w;
        scanf("%lld%lld%lld", &e[i].u, &e[i].v, &e[i].w);
        ++deg[e[i].u], ++deg[e[i].v];
    }
    for (int i = 1; i <= m; ++i) {
        if (deg[e[i].u] <= deg[e[i].v]) {
            path[e[i].u].emplace_back(e[i].v, e[i].w);
        }
        else {
            path[e[i].v].emplace_back(e[i].u, e[i].w);
        }
    }
    
    for (int i = 1; i <= n; ++i) {
        f[i] = 0;
    }
    for (int i = 1; i <= n; ++i) {
        // g[i] = 0x3f3f3f3f3f3f3f3f;
        for (auto it : path[i]) {
            g[it.first].insert(f[i] + it.second);
            // g[i] = min(g[i], f[it.first] + it.second);
        }
    }
    
    for (int i = 1; i <= q; ++i) {
        scanf("%d", &b[i]);
    }
    for (int i = q; i; --i) {
        int u = b[i];
        int tmp = f[u];
        if (g[u].empty()) {
            f[u] = 0x3f3f3f3f3f3f3f3f;
        }
        else f[u] = *g[u].begin();
        for (auto [v, w] : path[u]) {
            f[u] = min(f[u], f[v] + w);
        }
        for (auto [v, w] : path[u]) {
            g[v].erase(g[v].find(tmp + w));
            g[v].insert(f[u] + w);
        }
        // cerr << u << ' ' << f[u] << '\n';
    }
    // return 0;
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        f[i] %= mod;
        ans = add(ans, 1ll * f[i] * a[i] % mod);
    }
    printf("%d\n", ans);
    return 0;
}