#include<bits/stdc++.h>

using namespace std;

const int maxn=1e6+;

vector<int> g[maxn];

vector<int> topOrder;

int inDegree[maxn];

int N,M,x,y;

void topSort () {

    priority_queue<int> q;

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

    if (inDegree[i]==) q.push(i);

    while (!q.empty()) {

        int u=q.top();

        q.pop();

        topOrder.push_back(u);

        for (int i=;i<g[u].size();i++) {

               int v=g[u][i];

               if (--inDegree[v]==)

               q.push(v);

        }

    }

}

int num[maxn];

int main () {

    while(~scanf("%d %d",&N,&M)) {

        fill(inDegree,inDegree+maxn,);

        topOrder.clear();

        for (int i=;i<maxn;i++) g[i].clear();

        for (int i=;i<M;i++) {

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

            g[y].push_back(x);

            inDegree[x]++;

        }

        topSort();

        for (int i=;i<topOrder.size();i++) {

            num[topOrder[i]]=N-i;

        }

        for (int i=;i<=N;i++) {

            if (i!=) printf (" ");

            printf ("%d",num[i]);

        }

        printf ("\n");

    }

    return ;

}

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=;

const ll inf=1e18;

ll g[maxn][maxn];

ll w[maxn];

int visit[maxn];

ll d[maxn];

ll c[maxn];

int N;

ll prim (int s) {

    fill (d,d+maxn,inf);

    fill (visit,visit+maxn,);

    d[s]=w[s];

    ll ans=;

    for (int i=;i<=N;i++) {

        int u=-;ll mmin=inf;

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

        if (!visit[j]&&d[j]<mmin) {

            u=j;

            mmin=d[j];

        }

        if (u==-) return -;

        visit[u]=;

        ans+=d[u];

        //printf ("%d\n",d[u]);

        for (int v=;v<=N;v++)

        if (!visit[v]&&v!=u) d[v]=min(w[v],min(d[v],g[u][v]));

    }

    return ans;

}

struct node {

    int x,y;

}Node[maxn];

int main () {

    scanf("%d",&N);

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

    for (int j=;j<=N;j++) g[i][j]=inf;

    for (int i=;i<=N;i++) scanf("%d %d",&Node[i].x,&Node[i].y);

    for (int i=;i<=N;i++) scanf("%lld",&w[i]);

    for (int i=;i<=N;i++) scanf("%lld",&c[i]);

    for (int i=;i<=N;i++) {

        for (int j=i+;j<=N;j++) {

            ll dis=(c[i]+c[j])*(abs(Node[i].x-Node[j].x)+abs(Node[i].y-Node[j].y));

            //printf ("%lld\n",dis);

            g[i][j]=g[j][i]=dis;

        }

    }

    int u=-;

    ll mmin=inf;

    for (int i=;i<=N;i++) {

        if (w[i]<mmin) {

            mmin=w[i];u=i;

        }

    }

    ll ans=prim(u);

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

    return ;

}