#include<bits/stdc++.h>

#define ll long long

#define db double

using namespace std;

inline int read()

{

    int sum = ,p = ;

    char ch = getchar();

    while(ch < '' || ch > '')

    {

        if(ch == '-')

            p = -;

        ch = getchar();

    }

    while(ch >= '' && ch <= '')

    {

        (sum *= ) += ch - '';

        ch = getchar();

    }

    return sum * p;

}

const int N = 1e3 + ;

int n,A,B;

struct node

{

    int x,y;

} pot[N];

int cnt,fa[N],tot;

struct edge

{

    int frm,to;

    ll wei;

} e[N * N / + N];

ll ans;

void add(int a,int b,ll c)

{

    e[++cnt].frm = a;

    e[cnt].to = b;

    e[cnt].wei = c;

}

bool cmp(edge a,edge b)

{

    return a.wei < b.wei;

}

int findfa(int x)

{

    if(fa[x] == x)

        return x;

    else

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

}

void kruskal()

{

    sort(e+,e+cnt+,cmp);

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

        fa[i] = i;

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

    {

        int u = findfa(e[i].frm);

        int v = findfa(e[i].to);

        if(u == v)

            continue;

        fa[v] = u;

        tot++;

        ans += e[i].wei;

        if(tot == n)

            return;

    }

}

int main()

{

    freopen("pupil.in","r",stdin);

    freopen("pupil.out","w",stdout);

    n = read(),A = read(),B = read();

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

    {

        pot[i].x = read();

        pot[i].y = read();

    }

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

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

        {

            ll xx= abs(pot[i].x - pot[j].x);

            ll yy= abs(pot[i].y - pot[j].y);;

            add(i,j,(xx + yy) * B);

        //    add(j,i,len * B);

        }

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

    {

        add(,i,A);

    //    add(i,0,A);

    }

    kruskal();

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

    return ;

}

//不知道曼哈顿距离可还行