Codeforces Round #277 (Div. 2) D Valid Sets

D. Valid Sets

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

As you know, an undirected connected graph with n nodes and n - 1 edges is called a tree. You are given an integer d and a tree consisting of n nodes. Each node i has a value ai associated with it.

We call a set S of tree nodes valid if following conditions are satisfied:

1. S is non-empty.
2. S is connected. In other words, if nodes u and v are in S, then all nodes lying on the simple path between u and v should also be presented in S.
3. .

Your task is to count the number of valid sets. Since the result can be very large, you must print its remainder modulo 1000000007 (109 + 7).

Input

The first line contains two space-separated integers d (0 ≤ d ≤ 2000) and n (1 ≤ n ≤ 2000).

The second line contains n space-separated positive integers a1, a2, ..., an(1 ≤ ai ≤ 2000).

Then the next n - 1 line each contain pair of integers u and v (1 ≤ u, v ≤ n) denoting that there is an edge between u and v. It is guaranteed that these edges form a tree.

Output

Print the number of valid sets modulo 1000000007.

Sample test(s)

input

1 4
2 1 3 2
1 2
1 3
3 4

output

8

input

0 3
1 2 3
1 2
2 3

output

3

input

4 8
7 8 7 5 4 6 4 10
1 6
1 2
5 8
1 3
3 5
6 7
3 4

output

41

Note

In the first sample, there are exactly 8 valid sets: {1}, {2}, {3}, {4}, {1, 2}, {1, 3}, {3, 4} and {1, 3, 4}. Set {1, 2, 3, 4} is not valid, because the third condition isn't satisfied. Set {1, 4} satisfies the third condition, but conflicts with the second condition.

求不同的符合要求的set

刚开始不知道怎么去区别哪些set已经数过了。

看了别人的代码没想到只要规定一个顺序就可以了。

还是太弱了。

/***********************************************\
 |Author: YMC
 |Created Time: 2014/11/12 10:45:29
 |File Name: dd.cpp
 |Description: 
\***********************************************/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <algorithm>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#define L(rt) (rt<<1)
#define R(rt) (rt<<1|1)
#define mset(l,n) memset(l,n,sizeof(l))
#define rep(i,n) for(int i=0;i<n;++i)
#define maxx(a) memset(a, 0x3f, sizeof(a))
#define zero(a) memset(a, 0, sizeof(a))
#define srep(i,n) for(int i = 1;i <= n;i ++)
#define MP make_pair
const int inf=0x3f3f3f3f ;
const double eps=1e-8 ;
const double pi=acos (-1.0);
typedef long long ll;

using namespace std;
vector<int> ma[2005];
int a[2005];
ll num[2005];
ll ans = 0;
int d,n;
#define mod 1000000007
void dfs(int cu,int id,int fa) {
    num[cu] = 1;
    int len = ma[cu].size();
    rep(i,len) {
        int t = ma[cu][i];
        if(a[t] < a[id] || t == fa) continue;
        if(a[t] == a[id] && t > id) {
            dfs(t,id,cu);
            num[cu] = num[cu] * ( num[t] + 1 ) % mod;
            continue;
        }
        if(a[t] > a[id] && a[t] - a[id] <= d) {
            dfs(t,id,cu);
            num[cu] = num[cu] * ( num[t] + 1 ) % mod;
            continue;
        }
    }
}
int main() {
	//freopen("input.txt","r",stdin); 
    while(~scanf("%d %d",&d,&n)) {
        srep(i,n) ma[i].clear();
        int l,r;
        srep(i,n) {
            scanf("%d",&a[i]);
        }
        srep(i,n-1) {
            scanf("%d %d",&l,&r);
            ma[l].push_back(r);
            ma[r].push_back(l);
        }
        ans = 0;
        srep(i,n) {
            memset(num,0,sizeof num);
            dfs(i,i,-1);
            ans += num[i];
            ans %= mod;
        }
        printf("%I64d\n",ans);

    }
    
	return 0;
}