/* ***********************************************
Author        :kuangbin
Created Time  :2016/3/12 19:50:05
File Name     :F:\ACM\2016ACM\BestCoder\BC75\E.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;

const int MAXN = 1000;
const int MAXM = 300000;
const long long INF = 100000000000000000LL;
struct Edge
{
    int to,next,cap,flow,cost;
}edge[MAXM];
int head[MAXN],tol;
int pre[MAXN];
long long dis[MAXN];
bool vis[MAXN];
int N;//节点总个数，节点编号从0~N-1
void init(int n)
{
    N = n;
    tol = 0;
    memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int cap,int cost)
{
    edge[tol].to = v;
    edge[tol].cap = cap;
    edge[tol].cost = cost;
    edge[tol].flow = 0;
    edge[tol].next = head[u];
    head[u] = tol++;
    edge[tol].to = u;
    edge[tol].cap = 0;
    edge[tol].cost = -cost;
    edge[tol].flow = 0;
    edge[tol].next = head[v];
    head[v] = tol++;
}
bool spfa(int s,int t)
{
    queue<int>q;
    for(int i = 0;i < N;i++)
    {
        dis[i] = INF;
        vis[i] = false;
        pre[i] = -1;
    }
    dis[s] = 0;
    vis[s] = true;
    q.push(s);
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = false;
        for(int i = head[u]; i != -1;i = edge[i].next)
        {
            int v = edge[i].to;
            if(edge[i].cap > edge[i].flow &&
               dis[v] > dis[u] + edge[i].cost )
            {
                dis[v] = dis[u] + edge[i].cost;
                pre[v] = i;
                if(!vis[v])
                {
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    if(pre[t] == -1)return false;
    else return true;
}
//返回的是最大流，cost存的是最小费用
int minCostMaxflow(int s,int t,long long &cost)
{
    int flow = 0;
    cost = 0;
    while(spfa(s,t))
    {
        int Min = 100000000;
        for(int i = pre[t];i != -1;i = pre[edge[i^1].to])
        {
            if(Min > edge[i].cap - edge[i].flow)
                Min = edge[i].cap - edge[i].flow;
        }
        for(int i = pre[t];i != -1;i = pre[edge[i^1].to])
        {
            edge[i].flow += Min;
            edge[i^1].flow -= Min;
            cost += (long long)edge[i].cost * Min;
        }
        flow += Min;
    }
    return flow;
}


int a[220];
int Si[10],Ti[10];

const int PP = 1e8;

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int T;
    scanf("%d",&T);
    while(T--) {
        int n,k;
        scanf("%d%d",&n,&k);
        for(int i = 1;i <= n;i++)scanf("%d",&a[i]);
        int m,P,Q;
        scanf("%d%d%d",&m,&P,&Q);
        for(int i = 0;i < m;i++)
            scanf("%d%d",&Si[i],&Ti[i]);
        init(3*n+3);
        addedge(0,3*n+1,k,0);
        for(int i = 1;i <= n;i++) {
            addedge(2*i-1,2*i,a[i],-PP);
            addedge(2*i,2*n+i,a[i],0);
            addedge(2*n+i,3*n+2,a[i],0);
            addedge(0,2*n+i,a[i],0);
            addedge(3*n+1,2*i-1,a[i],0);
        }
        for(int i = P;i <= n;i++)
            addedge(0,2*i-1,a[i],Q);

        for(int i = 1;i <= n;i++) {
            for(int j = 0;j < m;j++) {
                if (i - Ti[j] <= 0)continue;
                for(int v = 1; v <= i-Ti[j];v++) {
                    addedge(2*v,2*i-1,a[v],Si[j]);
                }
            }
        }
        long long cost ;
        minCostMaxflow(0,3*n+2,cost);
        //printf("cost: %I64d\n",cost);
        for(int i = 1;i <= n;i++)cost += (long long)a[i]*PP;
        if(cost < 0 || cost >= PP) {
            puts("No solution");
        } else {
            printf("%d\n",(int)cost);
        }

    }
    return 0;
}