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;
int n;
int w[200005];
vector<pair<int, int> > v[200005];
int centroid;
int ch[200005], vis[200005];
double grd[200005];
double ans[200005];
int Ans;
void dfs(int now, int pre, int sz) {
  int i;
  ch[now] = 1;
  int maxch = 0;
  for (i = 0; i < v[now].size(); i++) {
    int to = v[now][i].first;
    if (vis[to] || to == pre) continue;
    dfs(to, now, sz);
    maxch = max(maxch, ch[to]);
    ch[now] += ch[to];
    ch[to] = 0;
  }
  maxch = max(maxch, sz - ch[now]);
  if (maxch <= sz / 2) centroid = now;
}
int dfs2(int now, int pre) {
  int ret = 1;
  int i;
  for (i = 0; i < v[now].size(); i++) {
    int to = v[now][i].first;
    if (vis[to] || to == pre) continue;
    ret += dfs2(to, now);
  }
  return ret;
}
void gradi(int now, int pre, long long int len) {
  grd[now] = sqrt(len) * w[now];
  int i;
  for (i = 0; i < v[now].size(); i++) {
    int to = v[now][i].first;
    if (to == pre) continue;
    gradi(to, now, len + v[now][i].second);
    grd[now] += grd[to];
  }
}
double getans(int now, int pre, long long int len) {
  double ret = sqrt(len) * len * w[now];
  int i;
  for (i = 0; i < v[now].size(); i++) {
    int to = v[now][i].first;
    if (to == pre) continue;
    ret += getans(to, now, len + v[now][i].second);
  }
  return ret;
}
void entry(int pt, int sz) {
  int cent;
  int i;
  dfs(pt, pt, sz);
  ch[pt] = 0;
  cent = centroid;
  vis[cent] = 1;
  gradi(cent, cent, 0);
  ans[cent] = getans(cent, cent, 0);
  double totgrd = 0;
  for (i = 0; i < v[cent].size(); i++) {
    totgrd += grd[v[cent][i].first];
  }
  for (i = 0; i < v[cent].size(); i++) {
    int ch = v[cent][i].first;
    int find = 0;
    if (totgrd - 2 * grd[ch] < 0) {
      if (vis[ch]) {
        Ans = ans[ch] < ans[cent] ? ch : cent;
        find = 1;
        return;
      } else {
        int chsz = dfs2(ch, ch);
        entry(ch, chsz);
      }
    }
    if (!find) Ans = cent;
  }
}
int main(void) {
  scanf("%d", &n);
  int i, j;
  for (i = 1; i <= n; i++) {
    scanf("%d", &w[i]);
    ch[i] = 0;
    vis[i] = 0;
    ans[i] = -1;
  }
  for (i = 0; i < n - 1; i++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    v[a].push_back(make_pair(b, c));
    v[b].push_back(make_pair(a, c));
  }
  entry(1, n);
  printf("%d %.8f\n", Ans, ans[Ans]);
  return 0;
}
