#pragma optimize("Ofast")
#include<bits/stdc++.h>
#define ll long long
#define mo 998244353

using namespace std;

const int N = 5e5 + 100;
int n, m, q, a[N], le[N], KK, b[N], bdy[N];
vector <int> zt[N], ls[N], rs[N];
struct node {
    int x, to, nxt;
}e[N << 6];
struct rem {
    int x, y, z;
}c[N];
ll f[N];
map <pair<int, int>, int> id;
bool in[N];

bool cmp1(rem x, rem y) {
    if (x.x != y.x) return x.x < y.x;
    if (x.y != y.y) return x.y < y.y;
    return x.z < y.z;
}

void add(int x, int y, int z) {
    e[++KK] = (node){z, y, le[x]}; le[x] = KK;
    // printf("%d %d\n", x, y);
}

void BFS() {
    for (int i = 1; i <= q + n; i++) f[i] = 1000000000000000000ll;
    priority_queue <pair<ll, int>, vector<pair<ll, int> >, greater<pair<ll, int> > > qs;
    for (int i = q + 1; i <= q + n; i++) {
        f[i] = 0; qs.push(make_pair(0, i));
    }
    while (!qs.empty()) {
        int now = qs.top().second; qs.pop();
        if (in[now] == 1) continue;
        in[now] = 1;
        for (int i = le[now]; i; i = e[i].nxt)
            if (f[e[i].to] > f[now] + e[i].x) {
                f[e[i].to] = f[now] + e[i].x;
                qs.push(make_pair(f[e[i].to], e[i].to));
            }
    }
}

int main() {
    scanf("%d %d %d", &n, &m, &q);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for (int i = 1; i <= m; i++) {
        scanf("%d %d %d", &c[i].x, &c[i].y, &c[i].z);
        if (c[i].x > c[i].y) swap(c[i].x, c[i].y);
    }
    sort(c + 1, c + m + 1, cmp1);
    for (int i = 1; i <= q; i++) {
        scanf("%d", &b[i]);
        zt[b[i]].push_back(i);
        id[make_pair(b[i], i)] = i;
    }
    for (int i = 1; i <= n; i++) {
        zt[i].push_back(q + 1), id[make_pair(i, q + 1)] = q + i;
        for (int j = 0; j < zt[i].size() - 1; j++) {
            add(id[make_pair(i, zt[i][j])], id[make_pair(i, zt[i][j + 1])], 0);
            ls[i].push_back(j ? zt[i][j - 1] + 1 : 1);
            rs[i].push_back(zt[i][j]);
        }
        ls[i].push_back(zt[i][zt[i].size() - 2] + 1);
        rs[i].push_back(q + 1);
    }

    for (int i = 1; i <= m; i++) {
        int x = c[i].x, y = c[i].y, z = c[i].z;
        if (i > 1 && x == c[i - 1].x && y == c[i - 1].y) continue;
        if (zt[x].size() > zt[y].size()) swap(x, y);
        for (int j = 0; j < zt[x].size(); j++) {
            int pl = lower_bound(rs[y].begin(), rs[y].end(), ls[x][j]) - rs[y].begin();
            add(id[make_pair(x, zt[x][j])], id[make_pair(y, zt[y][pl])], z);
            pl = upper_bound(ls[y].begin(), ls[y].end(), rs[x][j]) - ls[y].begin() - 1;
            add(id[make_pair(y, zt[y][pl])], id[make_pair(x, zt[x][j])], z);
        }
    }

    BFS();

    ll ans = 0;
    for (int i = 1; i <= n; i++) in[i] = 0;
    for (int i = 1; i <= q; i++) {
        if (in[b[i]] == 1) continue;
        in[b[i]] = 1;
        (ans += f[i] % mo * a[b[i]] % mo) %= mo;
        // ans += f[i] * a[b[i]];
    }
    printf("%lld\n", ans);

    return 0;
}