3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
int N, w[MAXN];
vector<pair<int, int> > e[MAXN];
bool vis[MAXN];
int cnt[MAXN], big[MAXN];
double ans = 1e25;
int ansdot;
vector<int> group;
void DFS1(int x, int p) {
  group.push_back(x);
  cnt[x] = 1;
  big[x] = 0;
  for (pair<int, int> u : e[x]) {
    if (u.first == p || vis[u.first]) continue;
    DFS1(u.first, x);
    cnt[x] += cnt[u.first];
    big[x] = max(big[x], cnt[u.first]);
  }
}
double subtree;
double DFS2(int x, int p, int d) {
  subtree += sqrt(d) * w[x];
  double re = (double)sqrt(d) * d * w[x];
  for (pair<int, int> u : e[x]) {
    if (u.first == p) continue;
    re += DFS2(u.first, x, d + u.second);
  }
  return re;
}
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%d", w + i);
  int a, b, l;
  for (int i = 1; i < N; i++) {
    scanf("%d%d%d", &a, &b, &l);
    e[a].push_back(make_pair(b, l));
    e[b].push_back(make_pair(a, l));
  }
  int tar = 1;
  while (1) {
    group.clear();
    DFS1(tar, 0);
    int h = -1, hmax = MAXN, sum = cnt[tar];
    for (int t : group) {
      big[t] = max(big[t], sum - cnt[t]);
      if (big[t] < hmax) h = t, hmax = big[t];
    }
    vis[h] = 1;
    int to = -1;
    double tomax = -1.0, tmp = 0.0;
    for (pair<int, int> u : e[h]) {
      subtree = 0.0;
      tmp += DFS2(u.first, h, u.second);
      if (subtree > tomax) to = u.first, tomax = subtree;
    }
    if (tmp < ans) ansdot = h, ans = tmp;
    tar = to;
    if (vis[tar]) break;
  }
  printf("%d %.10f\n", ansdot, ans);
  return 0;
}
