#include<stdio.h>

#include<string.h>

#include<map>

#include<iostream>

#include<algorithm>

#include<math.h>

#define N 1100

#define INF 0xfffffff

using namespace std;

int vis[N], n, pre[N];//pre[i]记录的是i的父节点；

double maps[N][N],dist[N];

void Prim(int start)

{

    vis[start] = ;

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

    {

        dist[i] = maps[start][i];

        pre[i] = start;

    }

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

    {

        double Min = INF;

        int index = -;

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

        {

            if(vis[j]== && Min>dist[j])

            {

                Min = dist[j];

                index = j;

            }

        }

        if(index == -) break;

        if(Min != )

            printf("%d %d\n", pre[index],index);

        vis[index] = ;

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

        {

            if(vis[j]== && dist[j] > maps[index][j])

                dist[j] = maps[index][j], pre[j] = index;

        }

    }

}

struct node

{

    int x, y;

}a[N];

void Init()

{

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

    {

        pre[i] = i;

        vis[i] = ;

        dist[i] = INF;

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

            maps[i][j] = INF;

        maps[i][i] = ;

    }

}

int main()

{

    int i, j, x, y, m;

    double d;

    while(scanf("%d", &n)!=EOF)

    {

        Init();

        memset(a,,sizeof(a));

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

            scanf("%d%d", &a[i].x, &a[i].y);

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

        {

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

            {

                d = sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y));

                maps[i][j] = maps[j][i] = d;

            }

        }

        scanf("%d", &m);

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

        {

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

            maps[x][y] = maps[y][x] = ; //把已知边的权值置为0；

        }

        Prim();

    }

    return ;

}