//最小生成树 Kruskal + 并查集
#include <iostream>
#include <cmath>
#define MAX 1001
using namespace std;
 
class tUFS
{
private:
	int F[MAX],Size;
	int findroot(int a)
	{
		int b=a,t;
		while (F[a]>0)
			a=F[a];
		while (F[b]>0)
		{
			t=F[b];
			F[b]=a;
			b=t;
		}
		return a;
	}
public:
	bool judge(int a,int b)
	{
		return F[findroot(a)]==F[findroot(b)];
	}
	void merge(int a,int b)
	{
		F[findroot(b)]=findroot(a);
	}
	tUFS(int N)
	{
		Size=N;
		for (int i=1;i<=N;i++)
			F[i]=-i;
	}
};
 
typedef struct
{
	int a,b;
	double v;
}edge;
 
typedef struct
{
	int x,y;
}point;
 
tUFS *U;
int N,M,C;
double Ans;
edge E[MAX*MAX];
point P[MAX];
 
void quicksort(int i,int j)
{
	int t1=i,t2=j;
	edge T,k=E[(i+j)/2];
	do
	{
		while (E[t1].v<k.v) t1++;
		while (E[t2].v>k.v) t2--;
		if (t1<=t2)
		{
			T=E[t1];
			E[t1]=E[t2];
			E[t2]=T;
 
			t1++;
			t2--;
		}
	}while (t1<t2);
	if (t2>i) quicksort(i,t2);
	if (t1<j) quicksort(t1,j);
}
 
inline double dist(point a,point b)
{
	return sqrt ( (double)(a.x-b.x)*(a.x-b.x) + (double)(a.y-b.y)*(a.y-b.y) );
}
 
void init()
{
	int i,j,a,b;
	freopen("roads.in","r",stdin);
	freopen("roads.out","w",stdout);
	scanf("%d%d",&N,&M);
	U=new tUFS(N);
	for (i=1;i<=N;i++)
		scanf("%d%d",&P[i].x,&P[i].y);
	for (i=1;i<=M;i++)
	{
		scanf("%d%d",&a,&b);
		if (!U->judge(a,b))
			U->merge(a,b);
	}
	for (i=C=1;i<=N-1;i++)
	{
		for (j=i+1;j<=N;j++,C++)
		{
			if (C==62375)
				C=C;
			E[C].a=i;
			E[C].b=j;
			E[C].v=dist(P[i],P[j]);
		}
	}
	C--;
	quicksort(1,C);
}
 
void kruskal()
{
	int i,cnt;
	for (i=1,cnt=0;i<=C && cnt<C-1-M;i++)
	{
		if (!U->judge(E[i].a,E[i].b))
		{
			U->merge(E[i].a,E[i].b);
			Ans+=E[i].v;
			cnt++;
		}
	}
}
 
int main()
{
	init();
	kruskal();
	printf("%.2lfn",Ans);
	return 0;
}