#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

const int MAXN = ;

inline int rd(){

    int x=,f=;char ch=getchar();

    while(!isdigit(ch)) {f=ch=='-'?:;ch=getchar();}

    while(isdigit(ch))  {x=(x<<)+(x<<)+ch-'';ch=getchar();}

    return f?x:-x;

}

void out(int x){

    if(!x) return;

    out(x/);

    putchar(''+x%);

}

int f[MAXN],n,m,ans;

void update(int x,int k){

    for(;x<=n;x+=x&-x) f[x]+=k;

}

int query(int x){

    int ret=;

    for(;x;x-=x&-x) ret+=f[x];

    return ret;

}

int main(){

//    freopen("Agent3.in","r",stdin);

//    freopen("T1.out","w",stdout);

    n=rd(),m=rd();

    int x,y,op;

    while(m--){

        op=rd();

        if(op==) {

            x=rd();y=rd();

            update(x,);update(y+,-);

        }

        else{

            x=rd();ans=query(x);if(!ans) putchar('');

            else out(query(x));putchar('\n');

        }

    }

    return ;

}

#include<iostream>

#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<cmath>

#define int long long

using namespace std;

const int MAXN = ;

typedef long long LL;

inline int rd(){

    int x=,f=;char ch=getchar();

    while(!isdigit(ch)) {f=ch=='-'?:;ch=getchar();}

    while(isdigit(ch))  {x=(x<<)+(x<<)+ch-'';ch=getchar();}

    return f?x:-x;

}

int n,m,K,t[MAXN];

int val[MAXN],ex[MAXN][MAXN];

LL dp[<<MAXN][MAXN],ans;

inline void MAX(){

    int S=;

    for(register int i=;i<=m;i++) S|=(<<(t[i]-));

    for(register int i=;i<=m;i++) ans=max(ans,dp[S][t[i]]);

}

void dfs(int x,int now){

    if(now==m) {MAX();return;}

    if(x==n+) return;

    t[now+]=x;dfs(x+,now+);

    t[now+]=;dfs(x+,now);

}

signed main(){

//    memset(dp,-0x3f,sizeof(dp));

    n=rd(),m=rd();K=rd();int x,y;

    for(register int i=;i<=n;i++) val[i]=rd();

    for(register int i=;i<=K;i++){

        x=rd(),y=rd();

        ex[x][y]+=rd();

    }dp[][]=;

    for(register int i=;i<=n;i++) dp[<<(i-)][i]=val[i];

    for(register int S=;S<<<n;S++)

        for(register int i=;i<=n;i++)if((S&(<<(i-))))

            for(register int j=;j<=n;j++)if(!(S&(<<(j-))))

                dp[S|(<<(j-))][j]=max(dp[S|(<<(j-))][j],dp[S][i]+val[j]+ex[i][j]);

//    cout<<ans<<endl;

    dfs(,);

    cout<<ans<<endl;

    return ;

}