#include<bits/stdc++.h>
using namespace std;
const int N = 1e4+10;
const int INF = 1e9;

struct node{
	int v;
	double p;
};
int n,m;
vector<node> a[N];
double dist[N];//从起点走到节点i的最大概率

void dijkstra(int s){
	for (int i = 0; i <= n; i++) {
        dist[i] = 0.0;
    }
	dist[s] = 1.0;
	priority_queue<pair<double,int>> pq;
	pq.push({1.0,s});
	while(!pq.empty()){
		double p = pq.top().first;
		int u = pq.top().second;
		pq.pop();
		
		if(p < dist[u]){
			continue;
		}
		
		for(int i = 0 ; i < a[u].size(); i++){
			int v = a[u][i].v;
			double w = a[u][i].p;
			if(dist[u]*w > dist[v]){
				dist[v] = dist[u] * w;
				pq.push({dist[v],v});
			}
		}
	}
	
}

int main(){
	
	cin>>n>>m;
	
	vector<pair<int,int>> temp_edge(m);
	for(int i = 0 ; i < m ; i++){
		cin>>temp_edge[i].first>>temp_edge[i].second;
	}
	for(int i = 0 ; i < m; i++){
		double curr_p;
		cin>>cu...