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 N = 200005;
int n;
int w[N];
vector<pair<int, int> > vec[N];
long double sum = 0;
long double ans1;
int ans;
long double val[N];
long double sumd;
void dfs(int x, int rt, int fa, long long dep) {
  sum = sum + w[x] * pow(dep, 1.5);
  val[rt] += w[x] * sqrt(dep) * 3 / 2;
  sumd += w[x] * sqrt(dep) * 3 / 2;
  int siz = vec[x].size();
  for (int u = 0; u < siz; u++) {
    int y = vec[x][u].first, z = vec[x][u].second;
    if (y == fa) continue;
    dfs(y, rt, x, dep + z);
  }
}
bool vis[N];
int tot[N];
int tmp, tmp1;
void get_root(int x, int fa, int nn) {
  tot[x] = 1;
  int mx = 0;
  int siz = vec[x].size();
  for (int u = 0; u < siz; u++) {
    int y = vec[x][u].first;
    if (y == fa || vis[y]) continue;
    get_root(y, x, nn);
    tot[x] = tot[x] + tot[y];
    mx = max(mx, tot[y]);
  }
  mx = max(mx, nn - tot[x]);
  if (mx < tmp1) {
    tmp1 = mx;
    tmp = x;
  }
}
void solve(int x, int nn) {
  tmp1 = nn + 1;
  get_root(x, 0, nn);
  x = tmp;
  get_root(x, 0, nn);
  int siz = vec[x].size();
  sum = 0;
  sumd = 0;
  vis[x] = true;
  for (int u = 0; u < siz; u++) {
    int y = vec[x][u].first;
    val[y] = 0;
    dfs(y, y, x, vec[x][u].second);
  }
  if (sum < ans1) {
    ans1 = sum;
    ans = x;
  }
  for (int u = 0; u < siz; u++) {
    int y = vec[x][u].first;
    if (vis[y]) continue;
    if (sumd - 2 * val[y] < 0) {
      solve(y, tot[y]);
      return;
    }
  }
}
int read() {
  char ch;
  while (!isdigit(ch = getchar()))
    ;
  int x = ch - 48;
  while (isdigit(ch = getchar())) x = x * 10 + ch - 48;
  return x;
}
int main() {
  n = read();
  for (int u = 1; u <= n; u++) w[u] = read();
  for (int u = 1; u < n; u++) {
    int x, y, l;
    x = read();
    y = read();
    l = read();
    vec[x].push_back({y, l});
    vec[y].push_back({x, l});
  }
  sum = 0;
  dfs(1, 0, 0, 0);
  ans1 = sum;
  ans = 1;
  memset(vis, false, sizeof(vis));
  solve(1, n);
  printf("%d %Lf\n", ans, ans1);
  return 0;
}
