B

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <array>
#include <set>
#include <map>

using namespace std;

#define int long long

const long long INF = 1e18 + 7;
const int MAXN = 1e1 + 100;
const int N = 3e5 + 10;
const int MOD = 1e9 + 7;

array<int, MAXN> cost;
int baff[MAXN][MAXN];
int dp[N][MAXN];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 0; i < n; ++i) {
        cin >> cost[i];
    }
    for (int i = 0; i < k; ++i) {
        int x, y, c;
        cin >> x >> y >> c;
        --x, --y;
        baff[x][y] = c;
    }
    for (int i = 0; i < n; ++i) {
        dp[1 << i][i] = cost[i];
    }
    for (int mask = 0; mask < (1 << n); ++mask) {
        for (int v = 0; v < n; ++v) {
            if (mask & (1 << v)) {
                for (int u = 0; u < n; ++u) {
                    if (!(mask & (1 << u))) {
                        int new_mask = mask | (1 << u);
                        dp[new_mask][u] = max(dp[new_mask][u], dp[mask][v] + cost[u] + baff[v][u]);
                    }
                }
            }
        }
    }
    int ans = 0;
    for (int mask = 0; mask < (1 << n); ++mask) {
        if (__builtin_popcountll(mask) == m) {
            for (int v = 0; v < n; ++v) {
                ans = max(ans, dp[mask][v]);
            }
        }
    }
    cout << ans << '\n';
}