#include<iostream>

#include<cstdio>

#include<cstring>

#include<queue>

using namespace std;

typedef long long ll;

queue<int>q;

int t,n,m,head[],ct,s[];

bool in[];

ll dis[],INF=1e10,ans;

struct N{

    int to,next,w;

    N(int t=,int n=,int ww=):to(t),next(n),w(ww) {}

}edge[];

int main()

{

    scanf("%d",&t);

    while(t--)

    {

        ct=;

        memset(head,,sizeof head);

        memset(in,,sizeof in);

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

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

            scanf("%d",&s[i]),dis[i]=INF;

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

        {

            int x,y,z;

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

            edge[++ct]=N(y,head[x],z);head[x]=ct;

            edge[++ct]=N(x,head[y],z);head[y]=ct;

        }

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

        dis[]=;q.push();in[]=;

        while(q.size())

        {

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

            in[x]=;

            for(int i=head[x];i;i=edge[i].next)

            {

                int u=edge[i].to;

                if(dis[u]>dis[x]+edge[i].w)

                {

                    dis[u]=dis[x]+edge[i].w;

                    if(!in[u])in[u]=,q.push(u);

                }

            }

        }

        bool flag=;ans=;

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

        {

            if(dis[i]==INF)

            {

                flag=;break;

            }

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

        }

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

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

    }

    return ;

}