#include<iostream>

#include<cstdio>

#include<cstring>

#include<queue>

using namespace std;

const long long INF=;

int T,n,m,head[],xnt,x,y,c[],z;

long long ans,dis[];

bool in[],flag;

struct Edge{

    int next,to,w;

    Edge(int ne=,int t=,int o=):next(ne),to(t),w(o) {}

}edge[];

queue<int> q;

void spfa()

{

    while(q.size())q.pop();

    memset(in,,sizeof in);

    in[]=;dis[]=;

    q.push();

    while(q.size())

    {

        int k=q.front();q.pop();

        in[k]=;///////!

        for(int i=head[k],v;i;i=edge[i].next)

            if(dis[k]+edge[i].w<dis[v=edge[i].to])

            {

                dis[v]=dis[k]+edge[i].w;

                if(!in[v])

                {

                    in[v]=;////////!

                    q.push(v);

                }

            }

    }

}

int main()

{

    scanf("%d",&T);

    while(T--)

    {

        memset(head,,sizeof head);

        ans=;xnt=;flag=;

        scanf("%d%d",&n,&m);

        for(int i=;i<=n;i++)scanf("%d",&c[i]),dis[i]=INF;

        for(int i=;i<=m;i++)

        {

            scanf("%d%d%d",&x,&y,&z);

            edge[++xnt]=Edge(head[x],y,z);head[x]=xnt;

            edge[++xnt]=Edge(head[y],x,z);head[y]=xnt;

        }

        spfa();

        for(int i=;i<=n;i++)

        {

            if(dis[i]==INF)

            {

                flag=;break;

            }

            ans+=c[i]*dis[i];

        }

        if(flag) printf("No Answer\n");

        else printf("%lld\n",ans);

    }

    return ;

}