#include <cstdio>

#include <iostream>

#include <cstring>

#include <string>

#include <algorithm>

#include <cmath>

const int maxn =;

const int mx   =2e6+;

using namespace std;

int n,m,fa[maxn];

struct node {

    int from;

    int to;

    double r;

}a[mx];

struct nn{

    int x,y;

}p[maxn];

bool cmp(node a,node b)

{

    return a.r>b.r;                    //这里的判断用大于，使得sort从大到小排列

}

void init(){

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

        fa[i] = i;

    memset(a,,sizeof(a));

    memset(p,,sizeof(p));

}

int find(int x)

{

    if(fa[x]==x)return x;

    else return fa[x] = find (fa[x]);

}

bool uni(int x,int y)

{

    int px = find(x);

    int py = find (y);

    if(px==py)return false;

    fa[px] = py;

    return true;

}

int main(){

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

    init();

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

    {

        int x,y;

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

        p[i].x=x;

        p[i].y=y;

    }

    double sum = ,res=;

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

    {

        int u,v;

        scanf("%d%d",&u,&v);

        double tmp = sqrt((p[u].x-p[v].x)*(p[u].x-p[v].x)+(p[u].y-p[v].y)*(p[u].y-p[v].y));

        a[i].from=u;

        a[i].to=v;

        a[i].r = tmp;

        sum+=tmp;

    }

    sort(a+,a++m,cmp);

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

    {

        int u = a[i].from;

        int v = a[i].to;

        if(uni(u,v))res+=a[i].r;

    }

    printf("%.3lf\n",sum-res);

    return ;

}