利用 MST 性質即可
//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%2d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int nx,ny;
int bx,by;
char mz\[M\]\[M\];
int dx\[\]={0,0,1,-1};
int dy\[\]={1,-1,0,0};
int dis\[M\]\[M\];
struct node{
int x,y;
node(){};
node(int x,int y):x(x),y(y){};
};
struct edge{
int a,b;
int w;
}edges\[10005\];
int n;
int asx\[105\];
int asy\[105\];
int asn;
int mingo(node a,node b){
Set(dis,-1);
int ans=0;
queue<node> q;
q.push(node(a.x,a.y));
dis\[a.x\]\[a.y\]=0;
while(!q.empty()){
int x=q.front().x;
int y=q.front().y;q.pop();
int d=dis\[x\]\[y\];
for(int i=0;i<4;i++){
int nex=x+dx\[i\],ney=y+dy\[i\];
if(mz\[ney\]\[nex\]=='#')continue;
if(dis\[nex\]\[ney\]==-1||d+1<dis\[nex\]\[ney\]){
dis\[nex\]\[ney\]=d+1;
q.push(node(nex,ney));
}
}
}
return dis\[b.x\]\[b.y\];
}
bool cmp(edge a,edge b){
return a.w<b.w;
}
int p\[105\];
int rk\[105\];
int getf(int x){
if(x!=p\[x\])p\[x\]=getf(p\[x\]);
return p\[x\];
}
void \_union(int x,int y){
if(rk\[x\]>rk\[y\])p\[y\]=x;
else{
p\[x\]=y;
if(rk\[x\]==rk\[y\])rk\[y\]++;
}
}
void solve(){
for(int i=0;i<n;i++){
p\[i\]=i;
rk\[i\]=0;
}
int ans=0;
sort(edges,edges+asn,cmp);
for(int i=0;i<asn;i++){
int x=edges\[i\].a;
int y=edges\[i\].b;
int w=edges\[i\].w;
x=getf(x);y=getf(y);
if(x!=y){
\_union(x,y);
ans+=w;
}
}
printf("%d\\n",ans);
}
int main(){
ios\_base::sync\_with\_stdio(0);
int test;
scanf("%d",&test);
while(test--){
asn=n=0;
int len;
scanf("%d%d%\*c",&nx,&ny);
for(int i=0;i<ny;i++){
gets(mz\[i\]);
len=strlen(mz\[i\]);
for(int j=0;j<len;j++){
if(mz\[i\]\[j\]=='S'){
bx=j;by=i;
asx\[n\]=j;
asy\[n++\]=i;
}
if(mz\[i\]\[j\]=='A'){
asx\[n\]=j;
asy\[n++\]=i;
}
}
}
// debug("%d\\n",n);
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
edges\[asn\].a=i;
edges\[asn\].b=j;
edges\[asn++\].w=mingo(node(asx\[i\],asy\[i\]),node(asx\[j\],asy\[j\]));
// debug("%d %d %d\\n",edges\[asn-1\].a,edges\[asn-1\].b,edges\[asn-1\].w);
}
}
solve();
}
}